How Binary Trees Work

Interactive BST — insert nodes and animate inorder, preorder, and postorder traversals

Binary Search Tree — Interactive

Insert nodes and watch traversals animate step-by-step

A BST: for every node, left < node < right

Visited (traversal)Search path (insert)Newly insertedNumbers = visit order

Left → Root → Right

Visits in sorted order for BSTs

Root → Left → Right

Useful for copying the tree structure

Left → Right → Root

Useful for deleting or evaluating