Binary Search Tree Visualizer

Interactive BST operations and traversals

Traversal:

Tree is empty

Insert values or create a sample tree to get started

In-Order

Left → Root → Right

Returns nodes in sorted order

Pre-Order

Root → Left → Right

Used to copy the tree

Post-Order

Left → Right → Root

Used to delete the tree