
- Home
- Books
- Algorithms & Data Structures
- Data Structures using C 2E
Data Structures Using C, 2nd Edition by Reema Thareja is an academic textbook covering the principles and implementation of data structures in C. Thareja bridges the gap between theoretical algorithm analysis and practical programming through detailed examples, algorithms, and illustrations. The book covers arrays, linked lists, trees, graphs, and hashing techniques.
What you will learn
- Implement linear collections including stacks, queues, and linked lists using pointers in C
- Construct binary trees, binary search trees, AVL trees, and multi-way search B-trees
- Represent directed and undirected graphs using adjacency lists and incidence matrices
- Execute traversal algorithms including breadth-first search and depth-first search
- Implement sorting algorithms including quicksort, mergesort, heapsort, and radix sort
- Build collision-resistant hash tables using linear probing and separate chaining
Who this is for
Computer science students, IT undergraduates, and software engineers seeking a solid foundation in data structures using C. Basic knowledge of C programming syntax is expected.


