Binary search tree: minimum

From Algowiki
Jump to: navigation, search
Binary search tree minimum path

TREE-MINIMUM (x)

while left[x] ≠ NULL
x = left[x]
return key[x]