This second edition of Data Structures Using C has been developed to provide a comprehensive and consistent coverage of both the abstract concepts of data structures as well as the implementation of these concepts using C language. It begins with a thorough overview of the concepts of C programming followed by introduction of different data structures and methods to analyse the complexity of different algorithms. It then connects these concepts and applies them to the study of various data structures such as arrays, strings, linked lists, stacks, queues, trees, heaps, and graphs.
The book utilizes a systematic approach wherein the design of each of the data structures is followed by algorithms of different operations that can be performed on them, and the analysis of these algorithms in terms of their running times.
Each chapter includes a variety of end-chapter exercises in the form of MCQs with answers, review questions, and programming exercises to help readers test their knowledge.
The book is good but has the usual drawback most academic books have. Although it starts with good examples and lots of code in the early chapters of simpler concepts that is not the case in the later chapters with more advanced concepts. I picked this to remember data structures for a project at work. I was mostly interested in B-trees and Red black trees which were not described as good as the simpler topics with code. Very well written and comprehensive though.