Eachchapter has several important example programs. Major elements of theseprograms are explained by dissection. The text emphasizes many of thestandard data structures from computer science. Stacks, safe arrays,dynamically allocated multidimensional arrays, lists, trees, and strings areall implemented. Exercises extend the student's understanding of how toimplement and use these structures.
Implementation is consistent with anabstract data type approach to software.
Many of the datastructure examples foreshadow its explanation and use. There is a strongemphasis on the template mechanism required for STL and the iterator idiomthat STL exploits. Chief additions include templates and exception handling. This has replaced stdio.h usedin the C community. Reference Value in Appendices.