Traversing a Binary Search Tree

inorder, preorder and postorder traversal (Reading time: 2 minutes)

We'll cover the following

There are three ways to traverse (go through) a binary search tree:


  • 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 1000+ tech skills courses.