Stacks, Queues, Circular Queues, Double Ended Queues, Infix to Postfix and Postfix Evaluation

Insertion at the Front, Insertion at the Rear, Deletion at the Rear, Deletion at the Front

Algorithm and Problems

Singly Linked List-Operations on Linked list, Stacks and Queues using Linked list, Polynomial representation using Linked list, Doubly linked list. Memory allocation-First fit, Best Fit and worst fit allocation

Trees: Representation of Trees; Binary Trees ; Binary Search Tree operations ; Binary Heaps; Graphs : BFS. DFS

Sorting and Searching- Insertion sort, Quick Sort ,Merge Sort , Heap sort Radix sort. Searching Techniques: Linear Search , Binary Search