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