deepest node in binary 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 PrintDeepestNode(Node *root){
if(root==NULL)
   return ;
queue<Node*>q;
stack<Node *>s;
q.push(root);
q.push(NULL);
while(!q.empty()){
  Node *temp=q.front();
  q.pop();
  if(temp!=NULL){
     s.push(temp);
     if(temp->right!=NULL)
        q.push(temp->right);
     if(temp->left!=NULL)
        q.push(temp->left);
     }
  else
    if(q.size()>0){
         q.push(NULL);
         s.push(NULL);
         }
   }
while(s.top()!=NULL){
  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)->left)->left=new Node(6);
  PrintDeepestNode(root);
  return 0;
  }