Tree Visualizer
Binary Search Trees
Build a BST, trace search decisions, and step through inorder traversal with highlighted nodes and synced pseudocode.
O(n)
Step Note
Start postorder traversal from the root.
function postorder(node: Node | null) {
if (!node) return
postorder(node.left)
postorder(node.right)
visit(node)
}