1- linked list: A-singly linked list B-Doubly Linked List c-Circular Linked List
2-STACK: A-implementation using array B-linked stack(implementation using linked list) C-Applications of Stack
3-Queue: A-simple queue B-circular queue D-deque C-priority queue 4-Tree A-BST(binary search tree): 1-ALL Operations B-traversal: 1-Depth-first Traversal: Pre Traversal post Traversal in-order Traversal
5-Sort Algorithm: A-bubble sort B-Merge Sort C-Insertion Sort D-Quick Sort E-selection sort