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:

Inorder

  • Left subtree
  • Root node
  • Right
...