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 inorder traversal from the root.
function inorder(node: Node | null) {
if (!node) return
inorder(node.left)
visit(node)
inorder(node.right)
}