Data Structures and C Programs

I found this book valuable to understand advanced, necessary, concepts in C: pointers, stacks and queues, memory organization, search algorithms, hashing, sorting trees, priority queues, and other basic advanced topics. In each topic, the book also goes into performance analysis, using O-notation. The book also uses pseudocode to help understand the algorithms, without the drawbacks of actual code. However, what I found bizarre about this book is that the first chapters (of basic concepts) had code examples, while the latter ones did not! Surely, a well-commented example of a red-black tree program would be the last step in teaching it. Especially in a book about "C programs".

I had found this book a few years ago, in my Master's, working on the side-project for my thesis. I started using the Knuth's books, for designing the data structures. First time I started working with it, I found the same level as on Knuth's, but using C. Fantastic. I did not have to think in PASCAL em C anymore, only in C. It cut my cycle to one third of the time.