Binary search tree: minimum

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

TREE-MINIMUM (x)

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