← Back to Trees
Tree Traversals Visualization
Explore different ways to visit all nodes in a binary tree: Inorder (left-root-right), Preorder (root-left-right), Postorder (left-right-root), and Level-order (breadth-first).
Traversal Type
Speed
800ms
Visited Nodes
0
Controls
Unvisited
Current
Visited
Traversal Result
Click "Start" to begin traversal
Traversal Types
Inorder (L-Root-R)
Left subtree → Root → Right subtree
Result: 4, 2, 5, 1, 6, 3, 7
Preorder (Root-L-R)
Root → Left subtree → Right subtree
Result: 1, 2, 4, 5, 3, 6, 7
Postorder (L-R-Root)
Left subtree → Right subtree → Root
Result: 4, 5, 2, 6, 7, 3, 1
Level-order (BFS)
Visit nodes level by level
Result: 1, 2, 3, 4, 5, 6, 7
Applications
- • Inorder: Get sorted values from BST
- • Preorder: Create copy of tree, prefix expressions
- • Postorder: Delete tree, postfix expressions
- • Level-order: Print tree by levels, BFS
- • Time Complexity: O(n) for all traversals
- • Space Complexity: O(h) where h is height