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 edit summary |
||
| Line 3: | Line 3: | ||
::x = right[x] | ::x = right[x] | ||
:return key[x] | :return key[x] | ||
[[Category:Binary Search Tree]] | |||
Revision as of 22:05, 19 September 2014
TREE-MAXiMUM (x)
- while right[x] ≠ NULL
- x = right[x]
- return key[x]