How to print reverse levelorder traversal

#1

How to print reverse level order traversal of tree .
Example:

Input:
2
1 3 2
10 20 30 40 60

Output:
3 2 1
40 60 20 30 10

#2

Create a map<int,vector > , and then store all node present at height x in map[x] vector. Then iterate over over map in backward direction and print values of each vector in different line.

#3

Abhishek Bhai maine aise apply kiya hai
https://practice.geeksforgeeks.org/problems/reverse-level-order-traversal/1

#4

@rssrivastavarohan
I am unable to see your code. Please save your code at ide.codingblocks.com and then share link here