Binary search tree: minimum

From Algowiki
Revision as of 16:13, 18 October 2014 by Luedecke (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
Binary search tree minimum path

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=1282"