Data Structures

1. Draw the UML diagram of a class doublyLinkedList

2. Suppose that intList is a list container and

intList = {3, 23, 23, 43, 56, 11, 11, 23, 25}

Show intList after the following statement executes: intList.unique();

Consider the following C++ statements. (The class unorderedLinkedList

is as defined in this chapter.)

unorderedLinkedList<int> list;

list.insertFirst(15);

list.insertLast(28);

list.insertFirst(30);

list.insertFirst(2);

list.insertLast(45);

list.insertFirst(38);

list.insertLast(25);

list.deleteNode(30);

list.insertFirst(18);

list.deleteNode(28);

list.deleteNode(12);

list.print();

What is the output of this program segment?

Solution: