C Program For Binary Search Tree Traversal
This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA
Overview
Download & View C Program For Binary Search Tree Traversal as PDF for free.
More details
- Words: 377
- Pages: 4
BINARY SEARCH TREE - TRAVERSAL #include<stdio.h> #include #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 Post Order\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. 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/
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 Post Order\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. 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/
Related Documents
C Program For Binary Search Tree Traversal
April 2020 9
C Program For Binary Search Tree
April 2020 13
Binary Search Tree
May 2020 11
Tree Traversal
November 2019 5
Tree Traversal
July 2020 4
Binary Search
July 2020 13More Documents from ""
C Program For Binary Search Tree
April 2020 13
C Program To Check Leap Year
April 2020 8
Cpp Program To Do String Manipulations
April 2020 10
C Program For Binary Search Tree Traversal
April 2020 9
