{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

21+-+Templates

# 21+-+Templates - EECS 280 Programming and Introductory Data...

This preview shows pages 1–11. Sign up to view the full content.

Templates EECS 280 Programming and Introductory Data Structures 1

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Linked Lists Double-ended list 2 What if we wanted to insert something at the end of the list? Intuitively, with the current representation, we'd need to walk down the list until we found "the last element", and then insert it there. That's not very efficient, because we'd have to examine every element to insert anything at the tail. first
Linked Lists Double-ended list 3 The new representational invariant has two node pointers: class IntList { node *first; node *last; public: }; The invariant on first is unchanged. The invariant on "last" is:

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Linked Lists Double-ended list 4 So, in an empty list, both data members point to NULL. However, if the list is non-empty, they look like this: Note: Adding this new data member requires that every method (except isEmpty ) be re-written. first last
Linked Lists Double-ended list 5 First, we create the new node, and establish its invariants: void IntList::insertLast(int v) { node *np = new node; np->next = NULL; np->value = v; ... }

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Linked Lists Double-ended list 6 To actually insert, there are two cases: If the list is empty, we need to reestablish the invariants on first and last (the new node is both the first and last node of the list) If the list is not empty, there are two broken invariants. The "old" last->next element (incorrectly) points to NULL, and the last field no longer points to the last element. first last np
Linked Lists Double-ended list 7 void IntList::insertLast(int v) { node *np = new node; np->next = NULL; np->value = v; if (isEmpty()) { first = last = np; } else { last->next = np; last = np; } first last np

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Linked Lists Double-ended list 8 This is efficient, but only for insertion. Question : Why is removal from the end expensive? first last np first last
Linked Lists Double-ended list 9 To make removal from the end efficient, as well, we have to have a “doubly-linked” list, so we can go forward and backward. To do this, we're going to change the representation yet again. In our new representation, a node is: struct node { node *next; node *prev; int value; }

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Linked Lists Double-ended list 10 With this representation, an empty list is unchanged.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern