Binary search tree: minimum

From Algowiki
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"