Binary search tree: maximum

From Algowiki
Revision as of 11:13, 13 September 2014 by Luedecke (talk | contribs) (Created page with "TREE-MAXiMUM (x) :while right[x] ≠ NULL ::x = right[x] :return key[x]")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

TREE-MAXiMUM (x)

while right[x] ≠ NULL
x = right[x]
return key[x]
Retrieved from "https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Binary_search_tree:_maximum&oldid=180"