C program for Binary Search Tree Traversal

BINARY SEARCH TREE - TRAVERSAL

#include #include #include 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 printf("%d ", T->element T->element); ); printpreorder(T printpreorder(T->left); ->left); printpreorder(T printpreorder(T->right); ->right); } } void printinorder(node T) { if(T != NULL) {

printinorder(T printinorder(T->left); ->left); printf("%d printf("%d ", T->element T->element); ); printinorder(T printinorder(T->right); ->right); } } void printpostorder(node T) { if(T != NULL) { printpostorde printpostorder(T->left); r(T->left); printpostorde printpostorder(T->right r(T->right); ); printf("%d printf("%d ", T->element T->element); ); } } void main() { int ch; ElementType a; root = NULL; while(1) { clrscr(); printf("\n1. printf("\n1. Insert\n2. Insert\n2. Print Print Pre Order\n3. Order\n3. Print In In Order\n4. Order\n4. Print Print Post Order\n5 Order\n5.. Exit\nEnter Your Choice : "); scanf("%d",&ch); switch(ch) { case 1: printf("Enter printf("Enter an element : "); scanf("%d", &a); root = insert(a, root); break; case 2: printpreorder(ro printpreorder(root); ot); break; case 3: printinorder(roo printinorder(root); t); break; case 4: printpostorder(ro printpostorder(root); ot); break; case 5: exit(0); default: printf("Invalid printf("Invalid Choice"); Choice"); } getch(); }

} Sample Output:

1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order 5. Exit Enter Your Choice : 1 Enter an Element : 1 1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order 5. Exit Enter Your Choice : 1 Enter an Element : 5

1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order 5. Exit Enter Your Choice : 1 Enter an Element : 2

1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order 5. Exit Enter Your Choice : 1 Enter an Element : 7 1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order 5. Exit Enter Your Choice : 2 1257 1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order

5. Exit Enter Your Choice : 3 1527 1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order 5. Exit Enter Your Choice : 4 2751 1. Insert 2. Print Pre Order 3. Print In Order 4. Print Post Order 5. Exit Enter Your Choice : 5 More useful programs @ http://www.gethugames.in/blog/

C program for Binary Search Tree Traversal

Recommend Documents