Binary search tree: minimum

From Algowiki

Revision as of 22:04, 19 September 2014 by Jhohmann (talk | contribs)

(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=196"

Binary Search Tree