rtbt1.c

right threaded binary tree

#include<stdio.h>
#include<conio.h>
#include"rtbtlib.c"

void main()
{
   node *s;
   char ch;
   int n,ele;
   clrscr();
   do
   {
     printf(" 1->insertion \n 2->inorder \n 3->large \n 4->smallest \n 5->delete \n 6->remove tree\n 7->search \n 8-> exit\n");
     scanf("%d",&n);
     switch(n)
     {
       case 1:  create(&s);
		do
		{
		  printf("element : ");
		  scanf("%d",&ele);
		  insert(&s,ele);
		  printf("again : ");
		  fflush(stdin);
		  scanf("%c",&ch);
		  }
		  while(ch=='y');
		 break;
       case 2: printf("the inorder traversing is \n");
	       inorder(s);
	       break;
       case 3: ele = large(s);
	       printf("largest ele : %d\n",ele);
	       break;
	case 4: ele = small(s);
	       printf("smallest ele : %d\n",ele);
	       break;
       case 8: exit();
	       break;

	   }
	   }while(n!=8);
	   getch();
}