Data Structures in C The text begins with an introduction to the

The text begins with an introduction to the most common concepts of C and then it goes on to give a detailed discussion on the processing of onedimensional and twodimensional arrays, their internal organization, and handling arrays using pointers.

Besides, it dwells on the dynamic linked list and its variations such as doubly linked lists and circular linked lists, with the help of memory diagrams.

The text delineates the static and dynamic implementations of stacks and queues, the application, implementation, and construction of binary trees, and representation of graphs and graph traversal.

The book concludes with a discussion on the various types of searching and sorting techniques, with the help of visual examples.