Binary Tree Traversal Visualizer

Enter numbers separated by commas or spaces and click Build tree — they are inserted in order into a Binary Search Tree (left < node < right; duplicates are skipped). Pick a traversal: Preorder (root → left → right), Inorder (left → root → right, which prints a BST in sorted order), Postorder (left → right → root), or Level order (breadth-first via a queue). The rose node is the one being visited right now, blue nodes are done. Next step advances one visit; Auto play runs the whole traversal; Reset returns to the start. The visit order and a step-by-step log appear below. Everything runs in your browser — no data is uploaded.