| Traversal through BSTs |
|
|
|
|
|
|
|
|
|
|
|
| • | Given
all of this, the recursive traversal algorithm |
|||||||||
| is: |
||||||||||
| Traverse
(Root) |
||||||||||
| If the Tree is not empty then |
||||||||||
| Visit the node at the Root (maybe
display) |
||||||||||
| Traverse(Left subtree) |
||||||||||
| Traverse(Right subtree) |
||||||||||