Preface
The main objective of this book is to teach data structure topics using C++ as well as to use
OOD to solve a particular problem. To do so, the book discusses data structures such as
linked lists, stacks, queues, and binary trees. C++’s Standard Template Library (STL) also provides the necessary code to implement these data structures. However, our emphasis is to
teach you how to develop your own code. At the same time, we also want you to learn how
to use professionally written code. Chapter 4 of this book introduces STL. In the subsequent
chapters, after explaining how to develop your own code, we also illustrate how to use the
existing STL code. The book can, therefore, be used in various ways. If you are not interested
in STL, say in the first reading, then you can skip Chapter 4 and in the subsequent chapters,
whenever we discuss a particular STL component, you can skip that section.
Chapter 6 discusses recursion. However, Chapter 6 is not a prerequisite for Chapters 7 and 8.
If you read Chapter 6 after these chapters, then you can skip the section ‘‘Removing
Recursion’’ in Chapter 7, and read this section after reading Chapter 6. Even though Chapter
6 is not required to study Chapter 9, ideally, Chapters 9 and 10 should be studied in sequence.
Therefore, we recommend that you should study Chapter 6 before Chapter 9. The following
diagram illustrates the dependency of chapters.
Hacene@freebooks
No comments:
Post a Comment
We are delighted to interact with the post, but please
Terms of comment:
The comment must be within the context of the entry was not to put any external links or publicity even published commentary.