Binary Tree Visualizer

Trees are recursive structures that are difficult to debug using text prints alone. Memorizing the differences between preorder, inorder, and postorder traversals is common, but visualizing which nodes are visited at each recursion step is rarely shown.

This visualizer solves this by dynamically rendering the BST as SVG circles and highlighting node visitation transitions in real time.

This sandbox teaches core hierarchic concepts:

• Hierarchic node structures (Parent/Child pointers)
• Binary Search Tree (BST) sorted insertion logic
• Preorder (NLR), Inorder (LNR), and Postorder (LRN) traversals
• Breadth First Search (BFS) level-order traversal queue logic
• Leaf nodes vs. internal nodes coordinates

An interactive BST visualizer featuring:

• •Dynamic SVG Tree builder plotting nodes and line edges automatically.
• •Interactive BST insertion form adding nodes to correct branches.
• •Clear Tree control to reset the SVG container.
• •DFS traversal path highlighting animations with step timers.
• •BFS Level Order traversal animation using queue state trace logs.

• Implement AVL Tree self-balancing rotation visualizers.
• Add Red-Black Tree node coloring transition steps.
• Include depth and balance metrics panel.