Go To Problem

Given a binary tree of size n, find its reverse level order traversal. ie- the traversal must begin from the last level.

Input:
          1
        /   \
       3     2
Output: 
      3 2 1
Explanation: 
  Traversing level 1 : 3 2
  Traversing level 0 : 1

Input:
         10
        /  \
       20   30
       / \ 
      40  60
Output:
      40 60 20 30 10
  Explanation:  
    Traversing level 2 : 40 60
    Traversing level 1 : 20 30
    Traversing level 0 : 10

• You don't need to read input or print anything. Complete the function reverseLevelOrder() which takes the root of the tree as input parameter and returns a list containing the reverse level order traversal of the given tree.

O(n)

O(n)

1 ≤ n ≤ 10⁴

• C++ Code
• Java Code
• Python Code
• Javascript Code