The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
Binary search tree minimum path
TREE-MINIMUM (x)
- while left[x] ≠ NULL
- x = left[x]
- return key[x]