BIN_TREE.rar_binary tree

#include <stdio.h> #include <stdlib.h> #include<conio.h> struct tree{ int val; tree *l, *r; }; tree *root,*cur; void main(){ int inp; clrscr(); root=(tree*)malloc(sizeof(struct tree)); root->val=20; root->l=NULL; root->r=NULL; printf("Input node values: "); while(inp!=666){ cur=root; scanf("%d",&inp); while(1){ if(inp<(cur->val)){ if(cur->l==NULL){ cur->l=(tree*)malloc(sizeof(struct tree)); cur=cur->l; cur->r=NULL; cur->l=NULL; cur->val=inp; break; } else { cur=cur->l; continue; } } else { if(cur->r==NULL){ cur->r=(tree*)malloc(sizeof(struct tree)); cur=cur->r; cur->r=NULL; cur->l=NULL; cur->val=inp; break; } else { cur=cur->r; continue; } } } } cur=root; printf("\n\nInput node value to search: "); scanf("%d",&inp); while(1){ if(inp<(cur->val)) if(cur->l==NULL){ printf("\n\nData not found."); break; } else { cur=cur->l;continue; } else if(inp>(cur->val)) if(cur->r==NULL){ printf("\n\nData not found."); break; } else { cur=cur->r;continue; } else if(inp==(cur->val)){ printf("\n\nData found on with the address %X.",cur); break; } } getch(); }