Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- typedef struct node
- {
- int data;
- struct node *left,*right;
- } node;
- node*root=NULL,*temp=NULL;
- void insert(node*temp,node*newnode)
- {
- if(newnode->data< temp->data)
- {
- if(temp->left==NULL)
- {
- temp->left=newnode;
- }
- else
- {
- insert(temp->left,newnode);
- }
- }
- else
- {
- if(temp->right==NULL)
- {
- temp->right=newnode;
- }
- else
- {
- insert(temp->right,newnode);
- }
- }
- }
- int main()
- {
- int i,n,f;
- scanf("%d",&n);
- for(i=1; i<=n; i++)
- {
- node*newnode=(node*)malloc(sizeof(node));
- scanf("%d",&newnode->data);
- newnode->left=NULL;
- newnode->right=NULL;
- if(root==NULL)
- {
- root=newnode;
- }
- else
- {
- insert(root,newnode);
- }
- }
- search(root,30);
- }
- void search(node*temp,int x)
- {
- if(temp==NULL)
- {
- printf("Not FOUND");
- }
- else if(temp->data==x)
- {
- printf("\n%d IS FOUND",x);
- }
- else if(x<temp->data)
- {
- search(temp->left,x);
- }
- else if(x>temp->data)
- {
- search(temp->right,x);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement