This post is completed by 1 user Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Medium

Print the Binary Tree in Vertical Order Path.

Objective: - Given a binary tree, print it in vertical order path.

What is Vertical Order

as you can see in the example above, [4],[2], [1,5,6],[3],[7] are the verical order of the given binary tree.

Approach:

• Its a tricky solution.
• Do the preordertraversal.
• Take a variable called level, when ever you go left, do level++ AND when ever you go right do level--.
• With step above we have separated out the levels vertically.
• Now you need to store the elements of each level, so create a TreeMap and the (key,value) pair will be (level,elements at that level).
• At the end iterate through the TreeMap and print the results.

Run This Code

Code:

Output:

[4]
[2]
[1, 5, 6]
[3]
[7]

---

---

Also Read:

- Binary Tree - Preorder Traversal - Non Recursive Approach Beginner
- Print the Vertical Sum in binary Tree . Medium
- Find the Distance between Two Nodes of a Binary Tree. Hard
- Find the Deepest Left Node in a Binary Tree. Medium
- Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard
- Inorder Successor in Binary Search Tree without Using Parent link Hard
- Introduction to Threaded Binary Tree Medium
- Find the local minima in a given array Medium

---