/* 1. WAP TO PERFORM PUSH,POP,AND DISPLAY OPERATION ON A STACK USING LINEAR ARRAY */

Size: px

Start display at page:

Download "/* 1. WAP TO PERFORM PUSH,POP,AND DISPLAY OPERATION ON A STACK USING LINEAR ARRAY */"

Louise Campbell
5 years ago
Views:

1 /* 1. WAP TO PERFORM PUSH,POP,AND DISPLAY OPERATION ON A STACK USING LINEAR ARRAY */ #include<stdio.h> #include<conio.h> int i,top,ch,s[3],item; void push(),pop(),dis(); main() top=-1; ch=0; while(ch!=4) printf("\nenter the menu for stack operation\n"); printf("\n1:insert\n2:delete\n3:display\n4:exit\n"); printf("input ur choice\n"); scanf("%d",&ch); switch(ch) case 1: push(); case 2: pop(); case 3: dis(); case 4: exit(0); default: printf("invalid choice\n"); return 0; void push() int item; if(top==3-1) printf("stack Overflow\n"); printf("enter an item to be pushed:"); scanf("%d",&item); top+=1; s[top]=item; void pop() if(top==-1) printf("stack Undeflow\n");

2 printf("item poped is %d\n",s[top--]); void dis() if(top==-1) printf("stack is empty\n"); printf("\nstack contains...\n"); for(i=0; i<=top; i++) printf("%d\t",s[i]);

3 /* 2. WAP TO PERFORM PUSH,POP AND DISPLAY OPERATIONS ON A STACK USING POINTERS */ #include<stdio.h> #include<conio.h> #define size 3 int i,num,ch,s[3],item[size]; struct stack int items[size]; int top; st; void push(struct stack*); void pop(struct stack*); void disp(struct stack*); main() st.top=-1; ch=0; while(ch!=4) printf("\nenter the menu for stack operation\n"); printf("\n1:push\n2:pop\n3:display\n4:exit\n"); printf("input ur choice\n"); scanf("%d",&ch); switch(ch) case 1:push(&st); case 2:pop(&st); case 3:disp(&st); case 4:exit(0); default: printf("invalid choice\n"); return 0; void push(struct stack *st) int item; if(st->top==size-1) printf("stack Overflow\n"); printf("enter an item to be pushed:"); scanf("%d",&item); st->top+=1; st->items[st->top]=item;

4 void pop(struct stack *st) if(st->top==-1) printf("stack Undeflow\n"); printf("item popped is %d\n",st->items[st->top--]); void disp(struct stack *st) if(st->top==-1) printf("stack is empty\n"); printf("\nstack contains...\n"); for(i=0; i<=st->top; i++) printf("%d\t",st->items[i]);

5 /* 3. i) Write a program to convert a postfix exp to infix exp */ #include<stdio.h> #include<string.h> void push(char item[],int *top,char s[20][20]) *top+=1; strcpy(s[*top],item); char *pop(int *top,char s[20][20]) char *item; item=s[*top]; *top-=1; return item; void pos_to_in(char postfix[], char infix[]) char s[20][20],symbol,temp[2],*op1,*op2; int i,top; top=-1; for(i=0; i<strlen(postfix); i++) symbol=postfix[i]; temp[0]=symbol; temp[1]='\0'; switch(symbol) case '+': case '-': case '*': case '/': case '$': default: op2=pop(&top,s); op1=pop(&top,s); strcpy(infix,"("); strcat(infix,op1); strcat(infix,temp); strcat(infix,op2); strcat(infix,")"); push(infix,&top,s); push(temp,&top,s);

6 main() char postfix[25],infix[25]; printf("enter ur postfix expr\n"); scanf("%s",postfix); pos_to_in(postfix,infix); printf("\nthe equivalent postfix is %s\n",infix); getch(); return 0;

7 /*3.ii) Write a program to convert a infix exp to postfix exp*/ #include<string.h> #include<stdio.h> int index=0,pos=0,lenght,top=-1; char infix[25],postfix[25],stack[25],temp,symbol; main() printf("enter ur infix expr\n"); scanf("%s",infix); in_to_pos(infix,postfix); printf("\nthe equivalent postfix is %s\n",postfix); return 0; in_to_pos(char infix[],char postfix[]) lenght=strlen(infix); push('#'); while(index < lenght) symbol=infix[index]; switch(symbol) case '(': push(symbol); case ')': temp=pop(); while(temp!='(') postfix[pos]=temp; pos++; temp=pop(); case '+': case '-': case '*': case '/': case '$': while(preced(stack[top]) >= preced(symbol) ) temp=pop(); postfix[pos++]=temp; push(symbol);

8 default: postfix[pos++]=symbol; index++; while(top > 0) temp=pop(); postfix[pos++]=temp; push(char symb) top+=1; stack[top]=symb; pop() char symb; symb=stack[top]; top-=1; return symb; int preced(char symb) int p; switch(symb) case '$': p=3; case '*': case '/': p=2; case '+': case '-': p=1; case '#': p=-1; return p;

9 /*4. WAP TO PERFORM AN EVALUATION OF AN POSTFIX EXPRESSION. */ #include<stdio.h> #include<ctype.h> int stack[25],top=-1; main() char postfix[25]; int i=0,value[20],result; printf("enter a valid postfix expr\n"); scanf("%s",postfix); while(postfix[i]!='\0') if(isalpha(postfix[i])) printf("enter the value %c\n",postfix[i]); scanf("%d",&value[i]); i++; result=eval_postfix(postfix,value); printf("the result of %s=%d\n",postfix,result); int eval_postfix(char postfix[],int data[]) int i=0,op1,op2,res; char ch; while(postfix[i]!='\0') ch=postfix[i]; if(isalpha(ch)) push(data[i]); op2=pop(); op1=pop(); switch(ch) case '+': push(op1+op2); case '-': push(op1-op2); case '/': push(op1/op2); case '*': push(op1*op2); case '$': push(op1^op2);

10 i++; res=pop(); return res; int push(int num) top+=1; stack[top]=num; int pop() int num; num=stack[top--]; return num;

11 /*5. WAP TO PERFORM INSERT,DELETE AND DISPLAY OPERATIONS ON A QUEUE USING LINEAR ARRAY. */ #include<stdio.h> #include<conio.h> int i,front,rear,ch,s[3],item; void insert(),delet(),dis(); main() front=0; rear=-1; ch=0; while(ch!=4) printf("\nenter the menu for queue operation\n"); printf("\n1:insert\n2:delete\n3:display\n4:exit\n"); printf("input ur choice\n"); scanf("%d",&ch); switch(ch) case 1: insert(); case 2: delet(); case 3: dis(); case 4: exit(0); default: printf("invalid choice\n"); return 0; void insert() int item; if(rear==3-1) printf("queue is overflow\n"); printf("enter an item to be inserted:"); scanf("%d",&item);

12 rear+=1; s[rear]=item; void delet() if(front>rear) printf("queue is empty\n"); printf("item to be deleted is %d\n",s[front++]); void dis() if(front>rear) printf("queue is empty\n"); printf("\nqueue contains...\n"); for(i=front; i<=rear; i++) printf("%d\t",s[i]);

13 /*6. WAP TO PERFORM INSERT,DELETE AND DISPLAY OPERATIONS ON A QUEUE USING POINTERS. */ #include<stdio.h> #include<conio.h> #define size 3 int i,num,ch,s[3],item[size]; struct queue int items[size]; int front,rear; q; void insert(struct queue *); void delet(struct queue *); void dis(struct queue *); main() q.front=0; q.rear=-1; ch=0; while(ch!=4) printf("\nenter the menu for queue operation\n"); printf("\n1:insert\n2:delete\n3:display\n4:exit\n"); printf("input ur choice\n"); scanf("%d",&ch); switch(ch) case 1: insert(&q); case 2: delet(&q); case 3: dis(&q); case 4: exit(0); default: printf("invalid choice\n"); return 0; void insert(struct queue *q)

14 int item; if(q->rear==size-1) printf("queue Overflow\n"); printf("enter an item to be pushed:"); scanf("%d",&item); q->rear+=1; q->items[q->rear]=item; void delet(struct queue *q) if(q->front>q->rear) printf("queue Undeflow\n"); printf("item to be deleted is %d\n",q->items[q->front++]); void dis(struct queue *q) if(q->front>q->rear) printf("queue is empty\n"); printf("\nqueue contains...\n"); for(i=q->front; i<=q->rear; i++) printf("%d\t",q->items[i]);

15 /* 7. Program to implement Singly linked list to perform addition, deletion & insertion */ #include <stdio.h> #include <conio.h> #include <alloc.h> void create(); void insert(); void delet(); void display(); struct node int data; struct node *link; ; struct node *first=null,*last=null,*next,*prev,*cur; void create() cur=(struct node*)malloc(sizeof(struct node)); printf("\nenter THE DATA: "); scanf("%d",&cur->data); cur->link=null; first=cur; last=cur; void insert() int pos,c=1; cur=(struct node*)malloc(sizeof(struct node)); printf("\nenter THE DATA: "); scanf("%d",&cur->data); printf("\nenter THE POSITION: "); scanf("%d",&pos); if((pos==1) &&(first!=null)) cur->link = first; first=cur; next=first; while(c<pos) prev=next; next=prev->link;

16 c++; if(prev==null) printf("\ninvalid POSITION\n"); cur->link=prev->link; prev->link=cur; void delet() int pos,c=1; printf("\nenter THE POSITION : "); scanf("%d",&pos); if(first==null) printf("\nlist IS EMPTY\n"); if(pos==1 && first->link==null) printf("\n DELETED ELEMENT IS %d\n",first->data); free(first); first=null; if(pos==1 && first->link!=null) cur=first; first=first->link; cur->link=null; printf("\n DELETED ELEMENT IS %d\n",cur->data); free(cur); next=first; while(c<pos) cur=next; next=next->link; c++;

17 cur->link=next->link; next->link=null; if(next==null) printf("\ninvalid POSITION\n"); printf("\n DELETED ELEMENT IS %d\n",next->data); free(next); void display() cur=first; while(cur!=null) printf("\n %d",cur->data); cur=cur->link; void main() int ch; printf("\n\nsingly LINKED LIST"); do printf("\n\n1.create\n2.insert\n3.delete\n4.exit"); printf("\n\nenter YOUR CHOICE : "); scanf("%d",&ch); switch(ch) case 1: create(); display(); case 2: insert(); display(); case 3: delet();

18 display(); case 4: exit(0); default: printf("invalid choice..."); while(1);

19 /*8. WAP to Reverse a single linked list */ #include<malloc.h> struct node int value; struct node *next; ; int main() int item,n; struct node * head; struct node * tail; struct node * temp; struct node * prev; struct node * current; struct node * next; temp=(struct node*)malloc(sizeof(struct node)); head=temp; printf("enter the size of list\n"); scanf("%d",&n); printf("enter the list to be reversed\n"); temp = (struct node *)malloc(sizeof(struct node)); scanf("%d",&item); temp->value = item; head = temp; n--; while(n!=0) temp->next = (struct node *)malloc(sizeof(struct node)); temp = temp->next; scanf("%d",&item); temp->value = item; --n; temp->next = NULL; tail = temp; temp = head; while(temp) printf(" %d\n", temp->value); temp = temp->next;

20 printf("reversing the linked list\n"); prev = NULL; current = next = head; while(current) next = current->next; current->next = prev; prev = current; current = next; temp = tail; while(temp) printf(" %d\n", temp->value); temp = temp->next; return 0;

21 /*9. WAP to accept two singly linked lists & create a new singly linked lists which contains the element that are common in both the lists*/ #include<stdio.h> # include<conio.h> # include <malloc.h> struct node int data; struct node *link; ; struct node *k; void main() int size1,size2,i, num; struct node *ptr,*ptr2,*result,*temp; struct node * concat(struct node *,struct node *); void display(struct node *); void add(struct node **,int ); ptr=null; ptr2 =NULL; result=null; printf("enter the size of 1st list \n"); scanf("%d",&size1); printf("enter the elements\n"); for(i=1;i<=size1;i++) scanf("%d",&num); add(&ptr,num); printf("enter the size of 2st list \n"); scanf("%d",&size2); printf("enter the elements\n"); for(i=1;i<=size2;i++) scanf("%d", &num); add(&ptr2, num); result = concat(ptr,ptr2); printf("common elements in the lists\n"); if(result==null) printf("no common elements\n"); display(result);

22 /* add an node to the list*/ void add(struct node **q,int num) struct node *temp; temp = *q; if(*q==null) *q=malloc(sizeof(struct node)); temp = *q; while((temp->link)!=null) temp=temp->link; temp->link = malloc(sizeof(struct node)); temp=temp->link; temp->data = num; temp->link = NULL; /* display the elements in the list*/ void display(struct node *pt) while(pt!=null) printf(" %d\n",pt->data); pt=pt->link; /* concatenation of lists*/ struct node *concat(struct node *p, struct node *q) struct node *x,*r,*i,*j; if(p==null) printf("no common elements\n");

23 if(q==null) printf("no common elements\n"); x=p; i=q; j=i; while(x!=null) while(i->link!=null && x->data!=i->data) i=i->link; if(i->link==null) x=x->link; i=j; if(x->data==i->data) add(&k,x->data); x=x->link; i=j; return(k);

24 /* 10. WAPto create double linked list to perform addition, deletion, and insertion operation. */ #include<stdio.h> #include<alloc.h> struct node int info; struct node *llink; struct node *rlink; ; typedef struct node *NODE; NODE getnode() NODE x; x=(node)malloc(sizeof(struct node)); if(x==null) printf("out of memory"); return x; NODE insert_front(int item,node head) NODE temp,cur; temp=getnode(); temp->info=item; cur=head->rlink; head->rlink=temp; temp->llink=head; temp->rlink=cur; cur->llink=temp; return head; NODE insert_rear(int item,node head) NODE temp,cur; temp=getnode(); temp->info=item; cur=head->llink; head->llink=temp; temp->rlink=head; /*temp->rlink=cur; */ cur->rlink=temp; return head;

25 NODE delete_front(node head) NODE cur,next; if(head->rlink==head) printf("queue is empty\n"); return head; cur=head->rlink; next=cur->rlink; head->rlink=next; next->llink=head; printf("item deleted=%d\n",cur->info); free(cur); return head; NODE delete_rear(node head) NODE cur,prev; if(head->llink==head) printf("dequeue is empty\n"); return head; cur=head->llink; prev=cur->llink; head->llink=prev; prev->rlink=head; printf("the node to be deletad is %d\n ",cur->info); free(cur); return head; void display(node head) NODE temp; if(head->rlink==head) printf("deque is empty\n"); printf("contents of deque are\n"); temp=head->rlink; while(temp!=head)

26 printf("%d\t",temp->info); temp=temp->rlink; printf("\n"); void main() NODE head; int choice,item; head=getnode(); head->rlink=head; head->llink=head; do printf("1.insert front\t2.insert rear\t3.delete front\n4.delete rear\t5.display\t6.exit\n"); printf("enter your choice\n"); scanf("%d",&choice); switch(choice) case 1:printf("Enter the item to be inserted at the front\n"); scanf("%d",&item); head=insert_front(item,head); case 2:printf("Enter the item\n"); scanf("%d",&item); head=insert_rear(item,head); case 3:head=delete_front(head); case 4:head=delete_rear(head); case 5:display(head); default:exit(0); while(choice!=6);

27 /* 11. WAP TO create, add, remove and display elementsfrom circular linked lists */ #include <stdio.h> #include <malloc.h> struct node int info; struct node *link; *last; main() int choice,n,m,po,i; last=null; while(1) printf("1.create List\n"); printf("2.add at begining\n"); printf("3.add after \n"); printf("4.delete\n"); printf("5.display\n"); printf("6.quit\n"); printf("enter your choice : "); scanf("%d",&choice); switch(choice) case 1: printf("how many nodes you want : "); scanf("%d",&n); for(i=0; i < n;i++) printf("enter the element : "); scanf("%d",&m); create_list(m); case 2: printf("enter the element : "); scanf("%d",&m); addatbeg(m); case 3: printf("enter the element : ");

28 scanf("%d",&m); printf("enter the position after which this element is inserted : "); scanf("%d",&po); addafter(m,po); case 4: if(last == NULL) printf("list underflow\n"); continue; printf("enter the number for deletion : "); scanf("%d",&m); del(m); case 5: display(); case 6: exit(0); default: printf("wrong choice\n"); /*End of switch*/ /*End of while*/ /*End of main()*/ create_list(int num) struct node *q,*tmp; tmp= malloc(sizeof(struct node)); tmp->info = num; if(last == NULL) last = tmp; tmp->link = last; tmp->link = last->link; /*added at the end of list*/ last->link = tmp; last = tmp; /*End of create_list()*/ addatbeg(int num)

29 struct node *tmp; tmp = malloc(sizeof(struct node)); tmp->info = num; tmp->link = last->link; last->link = tmp; /*End of addatbeg()*/ addafter(int num,int pos) struct node *tmp,*q; int i; q = last->link; for(i=0; i < pos-1; i++) q = q->link; if(q == last->link) printf("there are less than %d elements\n",pos); /*End of for*/ tmp = malloc(sizeof(struct node) ); tmp->link = q->link; tmp->info = num; q->link = tmp; if(q==last) /*Element inserted at the end*/ last=tmp; /*End of addafter()*/ del(int num) struct node *tmp,*q; if( last->link == last && last->info == num) /*Only one element*/ tmp = last; last = NULL; free(tmp); q = last->link; if(q->info == num) tmp = q;

30 last->link = q->link; free(tmp); while(q->link!= last) if(q->link->info == num) /*Element deleted in between*/ tmp = q->link; q->link = tmp->link; free(tmp); printf("%d deleted\n",num); q = q->link; /*End of while*/ if(q->link->info == num) /*Last element deleted q->link=last*/ tmp = q->link; q->link = last->link; free(tmp); last = q; printf("element %d not found\n",num); /*End of del()*/ display() struct node *q; if(last == NULL) printf("list is empty\n"); q = last->link; printf("list is :\n"); while(q!= last) printf("%d ", q->info); q = q->link; printf("%d\n",last->info); /*End of display()*/

31 /*12. WAP TO IMPLEMENT STACK USING LISTS. */ #include<stdio.h> typedef struct stack int data; struct stack *ptr; node; main() node *top; int data,rpt=1,choice; top=null; printf("\n using single linked list\n"); while(rpt) printf("\n1.push\n2.pop\n3.display\n4.exit\n"); printf("\n enter ur choice\n"); scanf("%d",&choice); switch(choice) case 1:printf("\n enter data\n"); scanf("%d",&data); push(data,&top); case 2:if(top==NULL) printf("\nstack underflow\n"); data=pop(&top); printf("\ndeleted item=%d",data); case 3:display(&top); case 4:exit(0); printf("\ndo u want to continue(type 1 or 0)\n"); scanf("%d",&rpt); node *getnode(int data)

32 node *temp; temp=(node*)malloc(sizeof(node)); if(temp==null) printf("cannot allocate memory\n"); temp->data=data; temp->ptr=null; return(temp); push(int data,node **top) node *newnode; newnode=getnode(data); newnode->ptr=*top; *top=newnode; pop(node **top) node *temp; int data; data=(*top)->data; temp=*top; *top=(*top)->ptr; free(temp); return(data); display(node **listptr) node *temp; temp=*listptr; if(temp==null) printf("\nstack is empty\n"); while(temp!=null) printf("%d\t",temp->data); temp=temp->ptr;

33 /*13. WAP FOR IMPLEMENTATION OF QUEUES USING LISTS */ #include<stdio.h> typedef struct queue int data; struct queue *ptr; Q; Q *front,*rear; Q *getnode(q *temp) temp=(q*)malloc(sizeof(q)); temp->ptr=null; return(temp); insert() Q *new; new=null; new=getnode(new); printf("\nenter data\n"); scanf("%d",&new->data); if(front==null) front=rear=new; rear->ptr=new; rear=rear->ptr; Q *delete() Q *temp; temp=front; if(front==null) printf("\nqueue underflow\n"); printf("the deleted element is %d\n",temp->data); front=front->ptr; free(temp); return(front);

34 display(q *front) Q *temp; if(front==null) printf("queue is empty\n"); printf("status of the Queue\n"); for(temp=front;temp!=rear->ptr;temp=temp->ptr) printf("%d\t",temp->data); main() int rpt=1,choice; front=null; rear=null; while(rpt) printf("1.insert\n2.delete\n3.display\n4.exit\n"); printf("enter your choice\n"); scanf("%d",&choice); switch(choice) case 1:insert(); case 2:front=delete(); case 3:display(front); case 4:exit(0); printf("\ndo u wanna continue (type 1 or 0)\n"); scanf("%d",&rpt);

35 /*14. WAP to create a tree and perform inorder, preoder &postorder tree traversal techniques.*/ #include<stdio.h> #include<process.h> #include<conio.h> struct node struct node *left; int item; struct node *right; ; int number,num,ch,x; struct node *tree,*p,*q; void inorder(struct node*); void preorder(struct node*); void postorder(struct node*); void main() void create(struct node*,int); tree=(struct node*)malloc(sizeof(struct node)); printf("input numbers one per line\n"); printf("press ctrl+z for EOF\n"); scanf("%d",&num); tree->item=num; tree->left=null; tree->right=null; while(scanf("%d",&num)!=eof) create(tree,num); do printf("1...inorder traversal\n"); printf("2...preorder traversal\n"); printf("3...postorder traversal\n"); printf("4...exit\n"); printf("enter the ur choice\n"); scanf("%d",&ch); switch(ch) case 1: printf("inorder traversal of a tree\n"); inorder(tree);

36 case 2: printf("preorder traversal of a tree\n"); preorder(tree); case 3: printf("postorder traversal of a tree\n"); postorder(tree); while(ch!=4); void create(struct node *p, int n) if(n >p->item) if(p->right==null) p->right=(struct node *)malloc(sizeof(struct node)); p=p->right; p->item=n; p->left=null; p->right=null; create(p->right,n); if(n<p->item) if(p->left==null) p->left=(struct node*)malloc(sizeof(struct node)); p=p->left; p->item=n; p->left=null; p->right=null; create(p->left,n); printf("number ios duplicate\n");

37 void inorder(struct node *p) if(p!=null) inorder(p->left); printf("%d\t",p->item); inorder(p->right); void preorder(struct node *p) if(p!=null) printf("%d\t",p->item); preorder(p->left); preorder(p->right); void postorder(struct node *p) if(p!=null) postorder(p->left); postorder(p->right); printf("%d\t",p->item);

38 /*15. Write a Program to construct Binary Search Tree and count number of leaves in binary tree*/ #include<stdio.h> #include<process.h> #include<conio.h> struct node struct node *left; int item; struct node *right; ; int number,num,ch,x; struct node *tree,*p,*q; void dis(struct node*); struct node* insert(struct node*,int); struct node* delet(struct node*,int); void main() void create(struct node*,int); tree=(struct node*)malloc(sizeof(struct node)); printf("input numbers one per line\n"); printf("press ctrl+z for EOF\n"); scanf("%d",&num); tree->item=num; tree->left=null; tree->right=null; while(scanf("%d",&num)!=eof) create(tree,num); do printf("1...search an data\n"); printf("2...display traversal\n"); printf("3...insert an data\n"); printf("4...delete an data\n"); printf("5...exit\n"); printf("enter the ur choice\n"); scanf("%d",&ch); switch(ch) case 1: search(); case 2:

39 printf("inorder traversal of a tree\n"); dis(tree); case 3: printf("input node value to insert\n"); scanf("%d",&num); tree=insert(tree,num); case 4: printf("input node value to delete \n"); scanf("%d",&x); tree=delet(tree,x); while(ch!=5); void create(struct node *p, int n) if(n >p->item) if(p->right==null) p->right=(struct node *)malloc(sizeof(struct node)); p=p->right; p->item=n; p->left=null; p->right=null; create(p->right,n); if(n<p->item) if(p->left==null) p->left=(struct node*)malloc(sizeof(struct node)); p=p->left; p->item=n; p->left=null; p->right=null;

40 create(p->left,n); printf("number ios duplicate\n"); search() printf("enter the number to search\n"); scanf("%d",&number); p=q=tree; while(number!=p->item && q!=null) p=q; if(number < p->item) q=p->left; q=p->right; if(number==p->item) printf("%d is Found\n",number); printf("unsuccessful search\n"); void dis(struct node *p) if(p!=null) dis(p->left); printf("%d\t",p->item); dis(p->right); struct node* insert(struct node *p, int n) struct node *temp,*prev,*cur; temp=(struct node*)malloc(sizeof(struct node)); temp->item=n; temp->left=null;

41 temp->right=null; if(p==null) return temp; cur=p; while(cur!=null) prev=cur; cur=(n<cur->item)?cur->left:cur->right; if(n<prev->item) prev->left=temp; prev->right=temp; return p; struct node* delet(struct node *p,int n) struct node *parent, *cur, *pred, *suc, *q; if (p==null) printf("enmty tree"); return(p); cur=p; while(cur!=null && n!=cur->item) parent=cur; cur=(n<cur->item)?cur->left:cur->right; if(cur==null) printf("node to be deleted is not found\n"); return p; if(cur->left==null) q=cur->right; if(cur->right==null) q=cur->left;

42 suc=cur->right; if(suc->left==null) suc->left=cur->left; q=suc; pred=cur->right; suc=pred->left; while(suc->left!=null) pred=suc; suc=pred->left; pred->left=suc->right; suc->left=cur->left; suc->right=cur->left; q=suc; if(parent->left==cur) parent->left=q; parent->right=q; free(cur); return p;

UNIT 4: Linked List Programs demonstrated in class. Tojo Mathew Asst. Professor CSE Dept., NIE Mysuru.

UNIT 4: Linked List Programs demonstrated in class. Tojo Mathew Asst. Professor CSE Dept., NIE Mysuru. 1 Table of Contents 1. Array Implementation of Linked List...3 2. Queue using Array Implementation