Preface to the Second Edition

I have been encouraged by the excellent response given by the readers to the first edition of the book to work on the second edition. As per the feedback received from the teachers of the subject and the input provided by the team at Pearson Education, the following topics in various chapters of the book have been added:

  1. Sparse matrices
  2. Recursion
  3. Hashing
  4. Weighted binary trees
    1. Huffman algorithm
  5. Spanning trees, minimum cost spanning trees
    1. Kruskal algorithm
    2. Prims algorithm
  6. Shortest path problems
    1. Warshall’s algorithm
    2. Floyd’s algorithm
    3. Dijkstra’s algorithm
  7. Indexed file organization

While revising the book, the text has been thoroughly edited and the errors found thereof have been corrected. More examples on important ...

Get Data Structures using C, 2nd Edition now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.