Tree Traversals - InOrder PreOrder and PostOrder

Tree Traversals - InOrder PreOrder and PostOrder

Tree is a non-linear data structure which organises a data in hierarchial structure. It is basially a colletion of nodes(vertex) and edges.

As trees are Non-linear data structures, so there are different techniques of tree traversals.

In case of Binary Trees,there are three possible ways to traverse a Binary Tree:

1. In-Order :  Left - Root - Right

2. Pre-Order : Root - Left - Right

3. Post-Order : Left - Right - Root 

C Program implementing InOrder, PreOrder and PostOrder Tree Traversals

#include<stdio.h> #include<malloc.h> struct node* insert(struct node*,int); struct node* createnode(int); void printsp(struct node*,int); void print(struct node*); struct node { int data; struct node *right; struct node *left; }; struct node *root; struct node* createnode(int val) { struct node *newnode; newnode=(struct node*)malloc(sizeof(struct node)); newnode->data=val; newnode->right=NULL; newnode->left=NULL; return (newnode); } struct node* insert(struct node*p,int data) { if(p==NULL) { p=createnode(data); return p; } else if(p->left==NULL) { p->left=createnode(data); return p; } else if(p->right==NULL) { p->right=createnode(data); return p; } else if(p->left->right!=NULL && p->right->right==NULL) { insert(p->right,data); return p; } else { insert(p->left,data); return p; } } void inorder(struct node *p) { if(p==NULL) return; else inorder(p->left); printf("%d\n",p->data); inorder(p->right); } void preorder(struct node *p) { if(p==NULL) return; else printf("%d\n",p->data); preorder(p->left); preorder(p->right); } void postorder(struct node *p) { if(p==NULL) return; else postorder(p->left); postorder(p->right); printf("%d\n",p->data); } int main() { char ch='y'; int data; while(ch=='y'||ch=='Y') { printf("Enter Data to be inserted"); scanf("%d",&data); root=insert(root,data); printf("Do you want to insert more?(y/n)"); scanf("%s",&ch); } printf("\nPreOrder"); preorder(root) printf("\nPostOrder"); postorder(root); printf("\nInOrder"); inorder(root); return 0; }

Share Share Tweet Share Share Share

LIKE?

SHARE If you find this useful, please share with your friends and Community.
CODE TOGETHER..GROW TOGETHER.