L1. Array
L2. Array
L3. Singly Linked List
L4. Circular Linked List
L5. Doubly Linked List
L6. Stack (Stack using Array & Linked List)
L7. Queue (Queue & Circular Queue using Array)
L8. Queue & Searching (Circular Queue using Linked List, PriorityQueue, Linear Search & Binary Search)
L9. Searching (LinearSearch, BinarySearch, TernarySearch & JumpSearch using recursion)
L10. Sorting (InsertionSort, bubbleSort, SelectionSort, SelectionSort using recursion)
L11. Sorting & Tree (MergeSort, QuickSort, BinaryTree)
L12. Binary Tree (pre-order, in-order, post-order traversal & Tree height)
L13. Binary Tree & AVL Tree