Binary Tree Visualizer

Binary Tree Visualizer

A simple binary tree visualizer to help you understand how binary trees work.

How Binary Tree Works

Binary Tree: A hierarchical data structure where each node has at most two children, referred to as left and right child.

  • insert(value) - Add a new node to the tree following BST rules.
  • delete(value) - Remove a node from the tree.
  • search(value) - Find if value exists in the tree.
  • inOrder() - Traverse: Left → Root → Right.
  • preOrder() - Traverse: Root → Left → Right.
  • postOrder() - Traverse: Left → Right → Root.
  • levelOrder() - Traverse level by level (BFS).
  • getHeight() - Get the height of the tree.
  • getSize() - Get the number of nodes in the tree.
  • getMin() - Find the minimum value in the tree.
  • getMax() - Find the maximum value in the tree.
  • clear() - Remove all nodes from the tree.

Edge Colors:

  • Left children: Red to orange gradient (#ff6b6b to #ff8e53)
  • Right children: Teal to green gradient (#4ecdc4 to #44a08d)
Left Child
Right Child
Root: -
Size: 0
Height: 0
Is Empty: Yes
Min Value: -
Max Value: -
Is Balanced: -

Learn More Data Structures