reverse level order traversing using stack,queue in a tree

#include<iostream>
#include<queue>
#include<stack>
using namespace std;

class Node{
  public:
      int data;
      Node *left,*right;
      Node(int key){
        data=key;
        left=NULL;
        right=NULL;
        }
  };

void ReverseLevelOrder(Node *root){
  if(root==NULL)
    return;
  stack<Node*>s;
  queue<Node*>q;
  q.push(root);
  s.push(root);
  while(!(q.empty())){
    Node *temp=q.front();
    q.pop();
    if(temp->right!=NULL){
      s.push(temp->right);
      q.push(temp->right);
      }
    if(temp->left!=NULL){
      s.push(temp->left);
      q.push(temp->left);
      }
    }
  while(!(s.empty())){
    cout<<" "<<(s.top())->data;
    s.pop();
  }
  }




int main(){
  Node *root=NULL;
  Node *newnode=new Node(1);
  root=newnode;
  root->left=new Node(2);
  root->right=new Node(3);
  (root->left)->left=new Node(4);
  (root->right)->right=new Node(5);
  (root->left)->right=new Node(6);
  ReverseLevelOrder(root);
  return 0;
  }