#include <stdio.h>
#include <stdlib.h>
typedef struct Node{
}
int main(){
printf("0. Exit\n");
printf("1. Insert\n");
printf("2. Delete\n");
printf("3. Display\n");
int choice, data;
while(1){
printf("Enter Choice: ");
scanf("%d", &choice);
switch(choice){
case 0:
exit(1);
case 1:
printf("Enter data to be inserted: ");
scanf("%d", &data);
break;
case 2:
printf("Enter data to be deleted: ");
scanf("%d", &data);
break;
case 3:
display();
printf("\n");
break;
default:
printf("Invalid choice...\n");
}
}
return 0;
}
Practice List for lab exm :( --->
- Doubly LL - Done
- Deque - Done
- Priority Q- Done
- Add and Mul - Done
- Sort List - Done
- Parenthesis Checker - Done
- Binary Search - Done
- Interpolation Search - Done
- Merge Sort - Done
- Insertion Sort - Done
- CLL - Done
- BST - Done
- Insert In a Sorted Way - Done
- AVL - Done
- Horner - Done
- BFS - Done
- DFS - Done
- Infix to Postfix - Done
- Prefix to Postfix - Done
- Postfix Evaluation - Done
- Tower Of Hanoi - Done
- Stack with Q - Done
- Q with Stack - Done
- Expression Tree - Done
- Josephus
- Heap Sort - Done