Data Structures in C
Build lists, stacks, trees and hash tables yourself, in the language that hides nothing
6 lessons · 1.2 hours of reading
· Intermediate · 3 free
The second-year data structures syllabus, written as working C programs instead of diagrams. Every structure is built from malloc and pointers so you can see exactly what it costs in time and memory.
Lessons
1
What a data structure buys you
Why the same data stored differently turns a 10-minute program into a 1-second one.
2
Arrays vs linked lists
The real trade-off, measured operation by operation, not repeated from a textbook table.
3
A singly linked list from scratch
Insert, delete, traverse, reverse and free - one complete working program.
4
Stacks and queues
Two restricted lists that solve a surprising number of real problems.
5
Binary search trees
Insert, search and inorder traversal, plus the case where a BST degrades to a list.
6
Hash tables and collisions
O(1) lookup, how the hash function decides everything, and what to do when two keys collide.
Lessons 4 to 6 need a Pro pass
A pass also opens every other course's paid lessons, all 50 mock test papers and the company-wise test series. It ends on its own date — nothing renews by itself and nothing is charged without you pressing a button.
See passes — from ₹29