Binary search tree: minimum: Difference between revisions

From Algowiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(One intermediate revision by the same user not shown)
Line 1: Line 1:
[[File:Bst_min.png|300px|thumb|right|Binary search tree minimum path]]
TREE-MINIMUM (x)
TREE-MINIMUM (x)
:while left[x] ≠ NULL
:while left[x] ≠ NULL

Latest revision as of 16:13, 18 October 2014

Binary search tree minimum path

TREE-MINIMUM (x)

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