Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- typedef struct node
- {
- int a;
- struct node *left, *right;
- }node;
- node *root=NULL, *temp=NULL;
- void insert(node *N, node *temp)
- {
- if(N->a<temp->a)
- {
- if(temp->left==NULL)
- {
- temp->left=N;
- }
- else
- {
- insert(temp->left, N);
- }
- }
- else
- {
- if(temp->right==NULL)
- {
- temp->right=N;
- }
- else
- {
- insert(temp->right, N);
- }
- }
- }
- void preorder()
- {
- while(temp!=NULL)
- {
- printf("Preorder: %d ", temp->a);
- preorder(temp->left);
- preorder(temp->right);
- }
- }
- int main()
- {
- int i;
- for(i=0; i<9; i++)
- {
- node *N=(node*)malloc(sizeof(node));
- scanf("%d", &N->a);
- N->left=NULL;
- N->right=NULL;
- if(root==NULL)
- {
- root=N;
- return;
- }
- else
- {
- insert(root, N);
- }
- }
- preorder();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement