Binary search tree: minimum: Difference between revisions
Jump to navigation
Jump to search
(Created page with "TREE-MINIMUM (x) :while left[x] ≠ NULL ::x = left[x] :return key[x]") |
No edit summary |
||
| Line 3: | Line 3: | ||
::x = left[x] | ::x = left[x] | ||
:return key[x] | :return key[x] | ||
[[Category:Binary Search Tree]] | |||
Revision as of 22:04, 19 September 2014
TREE-MINIMUM (x)
- while left[x] ≠ NULL
- x = left[x]
- return key[x]