← Back to DSA Visualizer

Binary Tree Visualization

A binary tree is a hierarchical data structure where each node has at most two children (left and right). Explore insertions, deletions, searches, and various tree traversals.

Tree Height

0

Node Count

0

Current Operation

None

Traversal

None

Tree Operations

Search

Tree Management

Tree Traversals

Normal Node
Current/Highlighted
Search Path
🌳

Empty Tree

Insert some nodes or generate a random tree to get started!

Binary Tree Operations

Traversal Types:

  • • Inorder: Left → Root → Right
  • • Preorder: Root → Left → Right
  • • Postorder: Left → Right → Root
  • • Level Order: Level by level (BFS)

Key Properties:

  • • Hierarchical data structure
  • • Each node has at most 2 children
  • • Root node at the top
  • • Leaf nodes have no children
  • • Used in expression parsing, Huffman coding