Professional Documents
Culture Documents
07 BinarySearchTree
07 BinarySearchTree
2 9
1 4 8
6 6
2 9 9
1 4 8 10 8
Minimum: 2 9
1 4 8
Tree-Maximum( )
1 while
2
3 return
Maximum:
Predecessor: :
Predecessor: :
Successor: :
Successor: :
for to do
Tree-Insert
Perform an in-order tree walk to
6
Example
2 9
Tree-walk time 1 4 8
2 9
1 4 8