There are three ways to traverse (go through) a binary search tree:
Inorder
- Left subtree
- Root node
- Right subtree
The inorder way is important if you want to flatten the tree back into its original sequence.
Get hands-on with 1400+ tech skills courses.