Vertical Order Traversal Of A Binarytree-ii

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. Given a Binary Tree, print Vertical Order of it. 
2. For each node at position (row, col), its left and right
children will be at positions (row + 1, col - 1) and (row + 1, col + 1)
respectively. The root of the tree is at (0, 0).
3. The vertical order traversal of a binary tree is a list of top-to-bottom
orderings for each column index starting from the leftmost column and ending
on the rightmost column. There may be multiple nodes in the same row and same
column. In such a case, sort these nodes by their values.
4. For More Information Watch Question Video link below.
Input Format
Input is managed for you.
Output Format
Output is managed for you. 
Question Video
Constraints
0 <= Number of Nodes <= 10^5
-1000 <= value of Node data <= 1000
Sample Input
15
1
1
-1
1
1
-1
1
-1
-1
1
-1
-1
1
-1
-1
Sample Output
0 -> 1 1 
1 -> 1 1 1
2 -> 1 1


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name