Tree View - Top View
Learn Tree View - Top View (Trees, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.
Top View - What's Visible Looking Down Assign each node a HORIZONTAL DISTANCE (HD) from the root: root = 0, left child = parent's HD - 1, right child = parent's HD + 1. The top view shows the FIRST node encountered at each distinct horizontal distance during a level-order (BFS) scan - "first" matters because BFS processes shallower nodes before deeper ones at the same HD.
More lessons in Trees
- Binary Tree
- Binary Search Tree - BST
- Full / Complete / Perfect Binary Tree
- Balanced Tree
- Tree Traversal - Preorder
- Tree Traversal - Inorder
- Tree Traversal - Postorder
- Tree Traversal - Level Order
- Recursive Traversal
- Iterative Traversal
- Height / Depth
- Diameter of a Tree
- Lowest Common Ancestor
- Path Sum
- Tree View - Left View
- Tree View - Right View
- Tree View - Bottom View
- Boundary Traversal
- Vertical Traversal
- Zigzag Traversal
- Serialize / Deserialize a Tree
- BST Operations
- BST Validation
- Kth Smallest / Largest in BST
- Morris Traversal