input: Write a python function to print reverse level order traversal of a binary tree.
  assert reverseLevelOrder(Node(1)) == [1]
  assert reverseLevelOrder(Node(1, Node(2), Node(3))) == [2, 3, 1]
  assert reverseLevelOrder(Node(1, Node(2, Node(4), Node(5)), Node(3))) == [4, 5, 2, 3, 1]
output: class Node:
      def __init__(self, key, left=None, right=None):
          self.data = key
          self.left = left
          self.right = right
  
  def reverseLevelOrder(root):
      if not root:
          return []
      queue = []
      stack = []
      queue.append(root)
      while len(queue) > 0:
          node = queue.pop(0)
          stack.append(node.data)
          if node.right:
              queue.append(node.right)
          if node.left:
              queue.append(node.left)
      return stack[::-1]