print ancestors of a given node in a binary tree (2)

#include<iostream>
using namespace std;

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

int PrintAncestors(Node* root,int key){
 if(root==NULL)
    return 0;
 if(root->data==key)
    return 1;
 if(PrintAncestors(root->left,key)||PrintAncestors(root->right,key)){
     cout<<" "<<root->data;
     return 1;
     }
 else
     return 0;
 }

int main(){
  Node* root=NULL;
  Node* newnode=new Node(1);
  root=newnode;
  root->left=new Node(9);
  root->right=new Node(3);
  (root->left)->left=new Node(2);
  (root->right)->right=new Node(4);
  if(!PrintAncestors(root,1))
    cout<<"ancestors not found";
  return 0;
  }