Binary search tree: maximum: Difference between revisions
Jump to navigation
Jump to search
(Created page with "TREE-MAXiMUM (x) :while right[x] ≠ NULL ::x = right[x] :return key[x]") |
(No difference)
|
Revision as of 11:13, 13 September 2014
TREE-MAXiMUM (x)
- while right[x] ≠ NULL
- x = right[x]
- return key[x]