Function main

CPP/BST/InsertionInABST.cpp:59–90

int main() {
  struct node *root = NULL;
  int ch;
    int x;
    cout<<"Press 0 to exit else enter 1: ";
    cin>>ch;
    while(ch!=0)
    {
        cout<<"\n"<<"1.Insertion"<<"\n"<<"2.View"<<"\n";
        cout<<"\n"<<"Enter choice :";
        cin>>ch;
        switch (ch)
        {
        case 1:
        	cout<<"Enter the value you want to insert in binary search tree: ";
        	cin>>x;
            root = insert(root, x);
            break;
        case 2:
            cout << "Inorder traversal: ";
 		  	 inorder(root);
            break;
      
        default:
            printf("\nINVALID CHOICE !!");
            break;
        }
    }
return 0;


}