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 difference)
|
Revision as of 11:12, 13 September 2014
TREE-MINIMUM (x)
- while left[x] ≠ NULL
- x = left[x]
- return key[x]