clinkmai.c

来自「right threaded binary tree」· C语言 代码 · 共 105 行

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

//main function
void main()
{
  node *d;
  int n,i;
  char ch1;
  clrscr();
  crtl(&d);
  do
  {
    printf("operations are\n");
    printf(" 1 -> insert at beg \n 2 -> insert at end \n 3 -> deletion at beg \n 4 -> deletion at end \n 5 -> display \n 6 -> insertion at position \n 7 -> deletion at position \n 8 for exit \n");
    scanf("%d",&n);
    switch(n)
    {
      case 1 : do
	      {
		 addatbeg(&d);
		 printf("again : ");
		 fflush(stdin);
		 scanf("%c",&ch1);
	       }
	       while(ch1=='y' || ch1=='Y');
	       break;

      case 2 :  do
		{
		 addatend(&d);
		 printf("again : ");
		 fflush(stdin);
		 scanf("%c",&ch1);
	       }
	       while(ch1=='y' || ch1=='Y');
	       break;

      case 3 : do
	       {
	       i = delatbeg(&d);
	       if(i)
	       {
		 printf("deleted ele %d \n",i);
		 printf("again : ");
		 fflush(stdin);
		 scanf("%c",&ch1);
	       }
	       }
	       while(ch1=='y'|| ch1 == 'Y');
	       break;

      case 4 : do
	       {
	       i = delatend(&d);
	       if(i)
	       {
		 printf("deleted ele %d \n",i);
		printf("again : ");
		fflush(stdin);
		scanf("%c",&ch1);
	       }
	       }
	       while(ch1=='y'|| ch1 == 'Y');
	       break;

      case 5 : display(&d);
	       break;

      case 6 : do
	      {
		 addatp(&d);
		 printf("again : ");
		 fflush(stdin);
		 scanf("%c",&ch1);
	       }
	       while(ch1=='y' || ch1=='Y');
	       break;

       case 7 : do
	       {
	       i = delatp(&d);
	       if(i)
	       {
		 printf("deleted ele %d \n",i);
		 printf("again : ");
		 fflush(stdin);
		 scanf("%c",&ch1);
	       }
	       }
	       while(ch1=='y'|| ch1 == 'Y');
	       break;

      case 8 : exit();
	       break;

      default : printf("sorry invalid choice \n");
		break;
     }
  }
  while(n!= 8);
  getch();
}