A Friendship Story of Learning Data Structures with C

Sr. No.	DSU BLOGS CHAPTERS
1	Array Operations in C, The Group of Friendship (Create, Insert, Delete & Display)
2	Searching Through the Squad, Linear Search in C
3	Linear Search in C (with Yes/No Continue Option)
4	Linear Search on Words in C
5	Binary Search, When Friends Divide and Conquer!
6	Binary Search on Strings, When Friends Go Alphabetical!
7	Bubble Sort, The One Where Friends Make Numbers “Bubble Up”
8	Bubble Sort (Strings), The One Where Friends Alphabetize the Fun Way
9	Selection Sort, The One Where Friends Pick the Smallest Numbers First
10	Selection Sort (Strings), The One Where Friends Compete to Find the Smallest Word
11	Insertion Sort, The One Where Friends Arrange Cards Like Pros
12	Insertion Sort (Strings), The One Where Friends Alphabetize Like Card Players
13	Linked List Operations, The One Where Friends Build a Chain Together
14	Linked List Operations, The One Where Friends Build and Break the Chain
15	Polynomial Representation, The One Where Friends Turn Math into Linked Lists
16	Adding Two Polynomials, The One Where Friends Combine Their Math Powers
17	Stack Using Array  The One Where Friends Follow the “Last In, First Out” Rule
18	Stack Using Linked List The One Where Friends Keep Pushing and Popping Everything
19	Multiplication Using Recursion The One Where Rahul Thinks He Invented Maths
20	Reverse String Using Recursion The One Where Aarav Thinks He’s a DJ
21	Reverse Traversal of Linked List The One Where Aarav Wants a “Back Button” in Real Life
22	Linear Queue Using Array The One Where Aarav Keeps Jumping the Line
23	Linear Queue Using Linked List The One Where Rahul Says “Dynamic Problems Need Dynamic Solutions”
24	Circular Queue Using Array The One Where Rahul Says “Dude, Stop Wasting Memory!”
25	Circular Queue Using Linked List The One Where Our Queue Turns Into a Never-Ending Circle
26	Priority Queue Using Linked List The One Where Friends Let “Priority Decide Everything”
27	Binary Search Tree (BST) The One Where Rahul Thinks Trees Can Sort Themselves
28	BST Traversals The One Where We Explore the Tree in Every Possible Direction