• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • CommentGo Back
Download
 
BINARY SEARCH TREE - TRAVERSAL
#include<stdio.h>#include<conio.h>#include<stdlib.h>struct TreeNode;typedef struct TreeNode *node;typedef int ElementType;struct TreeNode{int element;node left, right;}*root;node insert(ElementType x,node t){if(t==NULL){t = malloc(sizeof(node));t->element = x;t->left = t->right = NULL;}else{if(x < t->element)t->left = insert(x, t->left);else if(x > t->element)t->right = insert(x, t->right);}return t;}void printpreorder(node T){if(T != NULL){ printf("%d ", T->element); printpreorder(T->left); printpreorder(T->right);}}void printinorder(node T){if(T != NULL){
 
 printinorder(T->left); printf("%d ", T->element); printinorder(T->right);}}void printpostorder(node T){if(T != NULL){ printpostorder(T->left); printpostorder(T->right); printf("%d ", T->element);}}void main(){int ch;ElementType a;root = NULL;while(1){clrscr(); printf("\n1. Insert\n2. Print Pre Order\n3. Print In Order\n4. Print PostOrder\n5. Exit\nEnter Your Choice : ");scanf("%d",&ch);switch(ch){case 1: printf("Enter an element : ");scanf("%d", &a);root = insert(a, root); break;case 2: printpreorder(root); break;case 3: printinorder(root); break;case 4: printpostorder(root); break;case 5:exit(0);default: printf("Invalid Choice");}getch();}
 
}
Sample Output:
1. Insert2. Print Pre Order 3. Print In Order 4. Print Post Order 5. ExitEnter Your Choice : 1Enter an Element : 11. Insert2. Print Pre Order 3. Print In Order 4. Print Post Order 5. ExitEnter Your Choice : 1Enter an Element : 51. Insert2. Print Pre Order 3. Print In Order 4. Print Post Order 5. ExitEnter Your Choice : 1Enter an Element : 21. Insert2. Print Pre Order 3. Print In Order 4. Print Post Order 5. ExitEnter Your Choice : 1Enter an Element : 71. Insert2. Print Pre Order 3. Print In Order 4. Print Post Order 5. ExitEnter Your Choice : 21 2 5 71. Insert2. Print Pre Order 3. Print In Order 4. Print Post Order 
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
You must be to leave a comment.
Submit
Characters: ...