C++ Plus Data Structures, 6th Edition

CHAPTER 6: Lists Plus

© Repina Valeriya/Shutterstock

Goals

After studying this chapter, you should be able to:

• Use the C++ template mechanism for defining generic data types

• Implement a circular linked list

• Implement a linked list with a header node, a trailer node, or both

• Implement a doubly linked list

• Distinguish between shallow copying and deep copying

• Overload C++ operators

• Implement a linked list as an array of records

• Implement dynamic binding with virtual functions

• Use the C++11 range-based for loop

• Implement iterators with the C++11 range-based for loop

This chapter is a combination of both alternative implementations of lists and new theoretical material accompanied by the C++ implementations of the constructs. The chapter ...