Computer Science 1037A/B Lecture Notes - Lecture 43: A Private Function
5 May 2019
School
Department
Course
Professor
Document Summary
Each item except the first (front, head) has a unique predecessor. Each item except the last (end, tail) has a unique successor. First item has no predecessor, and last item has no successor. An item within a list is specified by its position in the list. In an unordered list, relative values of the items is not important. Insertions, deletions based on item value, rather than position. Must be able to compare items to determine where they belong in the list. Get the list item at a specified position. This diagram is based on the design decisions we"ve made so far type of m_container, and parameters and types for insert, remove, replace and retrieve are not yet known other attributes and functions may be added later. We"ll store either simple types (int, char ) or pointers to simple types or to more complex objects to avoid copying complex objects.
