Status Updates From Data Structures and Algorit...

ch 7 - 10: Non-Linear Data Structures (binary tree, heap, hash table, AVL tree, splay tree, red-black tree)

ch 1 - 6: Linear Data Structures (array, vector, linked-lists, stack, queue, deque)

This is a great book to start with algorithms and data structures using Cxx programming language. I'm going to read it faster due to my need of more skills in programming. Goodrich is a great writer, Thanks Michael!

chapter 3, mentioned a few interesting samples and used more complex methods to solve them. the book is getting harder, I'm not sure if it's getting any better! code samples are written badly! that is, it's not clean code. a lot of single character variables used like e, s, i and j. names are not intention revealing and can be hardly read. generally concepts are good for 1 year experienced programmers.

Just read chapter 2.
The explanation of C++ definitions is not as organized as a C++ reference like [Sams Teach Yourself C++], as this book is not intended to be a C++ reference but to be an algorithms teaching book. I read object oriented concepts like polymorphism and I found good details.
There was a problem in this chapter, the author said that there is no generic exception class in C++, though there is one.

First chapter teaches the parts of C++ language which is going to be used though out the rest of this book. The context is not clear, and it's the worst way of learning C++. there must be a previous knowledge of C++ before reading this book.