Binary Tree implementation code with print all paths in Binary tree Code in C.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 |
/* Binary Search tree code by condingstreet.com */ #include<stdio.h> #include<stdlib.h> struct Tnode { int val; struct Tnode *left,*right; }; struct snode{ struct Tnode *node; struct snode *next; }; int create_node(int val,struct Tnode **node){ struct Tnode *tmp; tmp=malloc(sizeof(struct Tnode)); if(tmp==NULL) return 0; tmp->val=val; tmp->left=NULL; tmp->right=NULL; (*node)=tmp; return 1; } void insert_node(struct Tnode **Troot,struct Tnode **node){ struct Tnode *parent,*tmp; int val; if((*node)==NULL) return; if((*Troot)==NULL){ (*Troot)=(*node); return; } tmp=(*Troot); val=(*node)->val; while(tmp!=NULL){ parent=tmp; if(val<tmp->val) tmp=tmp->left; else tmp=tmp->right; } if(val<parent->val){ parent->left=(*node); } else parent->right=(*node); return; } void push_sstack(struct snode **stack,struct Tnode *node){ struct snode *stop,*tmp; stop=*stack; if(stop==NULL){ tmp=malloc(sizeof(struct snode)); tmp->node=node; tmp->next=NULL; (*stack)=tmp; } else { tmp=malloc(sizeof(struct snode)); if(tmp!=NULL){ tmp->node=node; tmp->next=stop; (*stack)=tmp;} else printf(" \n Memory is Full Can't insert value\n "); } } struct Tnode *pop_sstack(struct snode **stack){ if((*stack)!=NULL) { struct Tnode *rval; struct snode *tmp,*stop; stop=(*stack); tmp=stop; rval=tmp->node; stop=stop->next; *stack=stop; tmp->next=NULL; free(tmp); return rval; } return NULL; } int is_stack_empty(struct snode **stack){ if((*stack)==NULL) return 1; else return 0; } void printpaths(struct Tnode *root){ int path[800]; printpathrec(root,path,0); } void printarray(int path[],int pathlen){ int i; for(i=0;i<pathlen;i++) printf(" %d ",path[i]); printf("\n"); } void printpathrec(struct Tnode *root, int path[],int pathlen){ if(root==NULL) return; path[pathlen]=root->val; pathlen++; if(root->left==NULL && root->right==NULL){ printarray(path,pathlen); } else { printpathrec(root->left,path,pathlen); printpathrec(root->right,path,pathlen); } } void inorder_iterative(struct Tnode **Troot ) { if((*Troot)==NULL) return; struct snode *s1; struct Tnode *curnode=(*Troot); while(!is_stack_empty(&s1) || curnode!=NULL) { if(curnode!=NULL) { push_sstack(&s1,curnode); curnode=curnode->left; } else { curnode=pop_sstack(&s1); printf(" %d ",curnode->val); curnode=curnode->right; } } } int main(){ struct Tnode *root=NULL,*node; int key,ival,*sum,ssum=0; sum=&ssum; do{ printf("\n[1] Insert value"); printf("\n[2] Print Tree (inorder) "); printf("\n[3] Print paths"); printf("\n[4] Exit "); printf("\nEnter the input key : "); scanf("%d",&key); switch(key){ case 1: printf("\n Enter the value to be inserted :"); scanf("%d",&ival); if(create_node(ival,&node)) insert_node(&root,&node); else printf("\n Memory is Full !! "); break; case 2: printf("\n Tree contents are :\n"); inorder_iterative(&root); break; case 3: printpaths(root); break; case 4: break; default: printf("\t Enter the Correct key !!!!! "); break; } }while(key!=4); printf("\n Thank you for using codingstreet.com 's datastructure solution "); return 0; } |