7_bstsearch(data lab).cpp

#include<bits/stdc++.h>
using namespace std;
struct TreeNode{
int info;
struct TreeNode *left;
struct TreeNode *right;

};
typedef struct TreeNode BstNode ;
BstNode* GetNode(int item)
{
BstNode* NewNode ;
NewNode = (BstNode*) malloc(sizeof(BstNode));
NewNode-> info = item;
NewNode-> left = NewNode ->right = 0;

return NewNode;
}


BstNode* Insert(BstNode* root,int data ){

if(root == 0) {
        root = GetNode(data);

}
else if(data <= root-> info ) root-> left = Insert(root-> left ,data);
else root-> right = Insert(root-> right ,data);


return root;
}

int search(BstNode *root , int data){
if(root == 0)return 0;
else if(root->info == data )return 1;
else if(data < root->info ) return search(root-> left, data);
else return search(root-> right, data);


}

int main(){
 // freopen("in.txt","r",stdin);
 // freopen("out.txt","w",stdout);
BstNode *root ;
    root = 0;
int k,j,i ;
printf("how many elements : ");

scanf("%d",&k);
for(i = 0; i< k; i++){
  scanf("%d",&j);
  root = Insert(root ,j );
}
while(1){
  printf("Enter item to search(0 to break) : ");
    scanf("%d",&k );
    if(search(root, k)==1) printf("item found\n");
    else printf("item not found\n");

}
return 0;}