|All-time Popular Problems|
|Delete Middle of Linked List|
|Find all four sum numbers|
|Find first set bit|
|Element with left side smaller and right side greater|
|Smallest Positive missing number|
|Intersection Point in Y Shapped Linked Lists|
|Largest Number formed from an Array|
|Reverse an Array|
Write a function to print Reverse Level Order Traversal of a tree. For below tree, function should print 4 5 2 3 1 .
The task is to complete the method which takes one argument, root of the Tree. The struct node has a data part which stores the data, pointer to left child and pointer to right child.
There are multiple test cases. For each test case, this method will be called individually.
The function should print reverse level order traversal of the tree.
1 <=T<= 30
1 <=Number of nodes<= 100
1 <=Data of a node<= 1000
1 2 R 1 3 L
10 20 L 10 30 R 20 40 L 20 60 R
3 2 1
40 60 20 30 10
There are two test casess. First case represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 3 and right child of 1 is 2. Second test case represents a tree with 4 edges and 5 nodes.