Бинарное дерево, проблема с функцией поиска

[rockfun]

Помогите,пожалуйста, разобраться!
не могу исправить ошибку в функции поиска.

#include<iostream>
using namespace std;
struct Node
{
int data;
Node *left;
Node *right;

};

Node *CreateNode ()
{
Node *newNode; //1
newNode = new Node; //2
cout<<"\nEnter a number to add to: ";
cin>>newNode->data; //3
newNode->left=NULL;
newNode->right=NULL; //4
return newNode; //5
}
/////////////////////////////////////////////
Node *FindNode (Node *cur, int x)
{
if (!cur) return NULL;
if (cur->data==x) return cur;
else {
if (cur->left!=NULL) FindNode(cur->left,x);

if (cur->right!=NULL) FindNode(cur->right,x);

}
}


///////////////////////////////////////////
int main (int argc,char *argv[])
{
Node *cur, *newNode;

int menu=0;
int x;
Node *root=NULL;
do
{
cout<<"\nChooseFunction!\n";
cout<<"\n1. CreateRoot\n";
cout<<"\n2. PrintTree\n";
cout<<"\n3. FindNode\n";
cout<<"\n4. LeftNode\n";
cout<<"\n5. RightNode\n";
cout<<"0. Exit\n";
cout<<"\nYourChoise: ";
cin>>izv;

switch(menu)
{ case 1: if (!root) { cout<<"Root ";
root=CreateNode();}
else cout<<"Root already is!!!";
break;
case 2: PrintTree (root); break;
case 3: if (root)
{cout<<"What search: ";
cin>>x;
cur=FindNode(root,x);
if (cur) cout<<"Is "<<x; else cout<<"Isn't "<<x;
}
else cout<<"List is empty!!!"; break;

[Blind Guard]

В дальнейшем берите код в спец. теги для удобства восприятия.
В чём проблема в вашем коде не знаю, но облегчу понимание другим

#include<iostream>
 using namespace std;

 struct Node
 {
 int data;
 Node *left;
 Node *right;
 };

 Node *CreateNode ()
 {
 Node *newNode; //1
 newNode = new Node; //2
 cout<<"\nEnter a number to add to: ";
 cin>>newNode->data; //3
 newNode->left=NULL;
 newNode->right=NULL; //4
 return newNode; //5
 }
 
 Node *FindNode (Node *cur, int x)
 {
 if (!cur) return NULL;
 if (cur->data==x) return cur;
 else
  {
   if (cur->left!=NULL) FindNode(cur->left,x);
   if (cur->right!=NULL) FindNode(cur->right,x);
  }
 }

 int main (int argc,char *argv[])
 {
 Node *cur, *newNode;
 int menu=0;
 int x;
 Node *root=NULL;
 do
 { 
 cout<<"\nChooseFunction!\n";
 cout<<"\n1. CreateRoot\n";
 cout<<"\n2. PrintTree\n";
 cout<<"\n3. FindNode\n";
 cout<<"\n4. LeftNode\n";
 cout<<"\n5. RightNode\n";
 cout<<"0. Exit\n";
 cout<<"\nYourChoise: ";
 cin>>izv;
 switch(menu)
 { case 1: if (!root) { cout<<"Root "; 
 root=CreateNode();} 
 else cout<<"Root already is!!!";
 break; 
 case 2: PrintTree (root); break;
 case 3: if (root)
 {cout<<"What search: ";
 cin>>x;
 cur=FindNode(root,x);
 if (cur) cout<<"Is "<<x; else cout<<"Isn't "<<x;
 }
 else cout<<"List is empty!!!"; break;