Skip to main content

🎮 Trees & BST (Practice)

Companion to the Trees & BST guide. Watch an in-order traversal emit BST values in sorted order, then code it.

🎬 Watch it work​

In-order Traversal — Left, Root, RightStep 1 / 9
5
3
8
2
4
7
9
BST in level-order. In-order = Left → Root → Right → sorted output.

🐍 Your turn​

Loading editor…

🧠 Challenge yourself​

  1. Write pre-order and post-order versions.
  2. Add an iterative in-order using an explicit stack.
  3. Given the sorted output, how would you verify the tree is a valid BST?

Continue the path → BFS & DFS