Binary search tree: minimum: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
m Luedecke moved page Binary Search Tree:Minimum to Binary search tree: minimum |
(No difference)
| |
Revision as of 08:40, 5 October 2014
TREE-MINIMUM (x)
- while left[x] ≠ NULL
- x = left[x]
- return key[x]