Traversal through BSTs
•
The inorder traversal algorithm would be:
•
Traverse (Root)
•
If the Tree is not empty then
•
Traverse(Left subtree)
•
Visit the node at the Root (display)
•
Traverse(Right subtree)
–
