no. of full nodes in a binary tree with recursion

#include<iostream>
using namespace std;

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

int CountFullNodes(Node *root){
  if(root==NULL)
        return 0;
  int count=0;
  if(root->left!=NULL && root->right !=NULL)
    count++;
  return count+CountFullNodes(root->left)+CountFullNodes(root->right);
  }

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)->right=new Node(6);
  cout<<CountFullNodes(root);
  return 0;
  }