Binary search tree: minimum
Revision as of 08:40, 5 October 2014 by Luedecke (talk | contribs) (Luedecke moved page Binary Search Tree:Minimum to Binary search tree: minimum)
TREE-MINIMUM (x)
- while left[x] ≠ NULL
- x = left[x]
- return key[x]
TREE-MINIMUM (x)