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:

- Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed Medium
- Tree Traversals Beginner
- Check if the given binary tree is Full or not. Beginner
- Make a Binary Tree from Given Inorder and Preorder Traversal Hard
- Print All Possible Valid Combinations Of Parenthesis of Given 'N' Medium
- Binary Tree-Inorder Traversal - Non Recursive Approach Beginner
- Find the Max element in a Given Binary Tree Beginner
- Backtracking - Search a Word In a Matrix Hard

---