Data Structure

Linked Lists
List Overview
§Linked lists
§Abstract data type (ADT)
§Basic operations of linked lists
§Insert, find, delete, print, etc.
§Algorithms on linked lists
§Variations of linked lists
§Circular linked lists
§Doubly linked lists
 Linked Lists

A B C Æ

Head
§ A linked list is a series of connected nodes
§ Each node contains at least
§ A piece of data (any type)
§ Pointer to the next node in the list
§ Head: pointer to the first node
§ The last node points to NULL
node

data pointer
Linked Lists: Some Properties

• Pointer current: same type as pointer head

– current = head;
• Copies value of head into current
– current = current->link;
• Copies value of current->link (2800) into current

!FIGURE 5-5 List after the statement

!current = current->link;executes
!4
!Linked Lists: Some Properties
!TABLE 5-2 Values of current, head, and some of the
nodes of the linked list in Figure 5-5

!5
 A Simple Linked List Class
§ We use two structures: Node and List
§ Declare Node class for the nodes
§ data: double-type data in this example
§ next: a pointer to the next node in the list

struct Node{
int data; // data
Node* next; // pointer to next node
};

//typedef Node* NodePtr;

 A Simple Linked List Class
§ Declare List, which contains
§ head: a pointer to the first node in the list.
Since the list is empty initially, head is set to NULL
§ Operations on List
class List {
private:
Node* head;
public:
List() { head = NULL; } // constructor
~List(); // destructor

bool IsEmpty() { return head == NULL; }

Node* InsertNode(int index, double x);
int FindNode(double x);
int DeleteNode(double x);
void DisplayList();
};
A Simple Linked List Class

§ Operations of List
§ IsEmpty: determine whether or not the list is empty
§ InsertNode: insert a new node at a particular position
§ FindNode: find a node with a given value
§ DeleteNode: delete a node with a given value
§ DisplayList: print all the nodes in the list
 Inserting a new node
§ Node* InsertNode(int index, double x)
§ Insert a node with data equal to x after the index’th elements.
(i.e., when index = 0, insert the node as the first element;
when index = 1, insert the node after the first element, and so on)
§ If the insertion is successful, return the inserted node.
Otherwise, return NULL.
(If index is < 0 or > length of the list, the insertion will fail.)

§ Steps index’th
1. Locate index’th element element

2. Allocate memory for the new node

3. Point the new node to its successor
4. Point the new node’s predecessor to the new node
newNode
 Inserting a new node
§ Possible cases of InsertNode
1. Insert into an empty list
2. Insert in front
3. Insert at back
4. Insert in middle
§ But, in fact, only need to handle two cases
§ Insert as the first node (Case 1 and Case 2)
§ Insert in the middle or at the end of the list (Case 3 and Case 4)
 Inserting a new node
Node* List::InsertNode(int index, double x) { Try to locate
if (index < 0) return NULL; index’th node. If it
doesn’t exist,
int currIndex = 1;
Node* currNode = head; return NULL.
while (index > currIndex) {
currNode = currNode->next;
currIndex++;
}
if (index > 0 && currNode == NULL) return NULL;

Node* newNode = new Node;

newNode->data = x;
if (index == 0) {
newNode->next = head;
head = newNode;
}
else {
newNode->next = currNode->next;
currNode->next = newNode;
}
return newNode;
}
 Inserting a new node
Node* List::InsertNode(int index, double x) {
if (index < 0) return NULL;

int currIndex = 1;
Node* currNode = head;
while (index > currIndex) {
currNode = currNode->next;
currIndex++;
}
if (index > 0 && currNode == NULL) return NULL;

Node* newNode = new Node;

newNode->data = x;
if (index == 0) {
newNode->next = head; Create a new node
head = newNode;
}
else {
newNode->next = currNode->next;
currNode->next = newNode;
}
return newNode;
}
 Inserting a new node
Node* List::InsertNode(int index, double x) {
if (index < 0) return NULL;

int currIndex = 1;
Node* currNode = head;
while (index > currIndex) {
currNode = currNode->next;
currIndex++;
}
if (index > 0 && currNode == NULL) return NULL;

Node* newNode = new Node;

Insert as first element
newNode->data = x;
if (index == 0) { head
newNode->next = head;
head = newNode;
}
else {
newNode->next = currNode->next; newNode
currNode->next = newNode;
}
return newNode;
}
 Inserting a new node
Node* List::InsertNode(int index, double x) {
if (index < 0) return NULL;

int currIndex = 1;
Node* currNode = head;
while (index > currIndex) {
currNode = currNode->next;
currIndex++;
}
if (index > 0 && currNode == NULL) return NULL;

Node* newNode = new Node; AddHead/ InsertFront

newNode->data = x;
if (index == 0) { head
newNode->next = head;
head = newNode;
}
else {
newNode->next = currNode->next; newNode
currNode->next = newNode;
}
return newNode;
}
 Inserting a new node
Node* List::InsertNode(int index, double x) {
if (index < 0) return NULL;

int currIndex = 1;
Node* currNode = head;
while (index > currIndex) {
currNode = currNode->next;
currIndex++;
}
if (index > 0 && currNode == NULL) return NULL;

Node* newNode = new Node;

newNode->data = x;
if (index == 0) {
newNode->next = head;
head = newNode; Insert after currNode
} currNode
else {
newNode->next = currNode->next;
currNode->next = newNode;
}
return newNode;
} newNode
 Finding a node
§ int FindNode(double x)
§ Search for a node with the value equal to x in the list.
§ If such a node is found, return its position. Otherwise, return 0.

int List::FindNode(double x) {
Node* currNode = head;
int currIndex = 1;
while (currNode->data != x) {
currNode = currNode->next;
currIndex++;
}
if (currNode) return currIndex;
return 0;
}
Deleting a node
§ int DeleteNode(double x)
§ Delete a node with the value equal to x from the list.
§ If such a node is found, return its position. Otherwise, return 0.
§ Steps
§ Find the desirable node (similar to FindNode)
§ Release the memory occupied by the found node
§ Set the pointer of the predecessor of the found node to the
successor of the found node
§ Like InsertNode, there are two special cases
§ Delete first node
§ Delete the node in middle or at the end of the list
Deleting a node
int List::DeleteNode(double x) {
Node* prevNode = NULL;
Try to find the node with
Node* currNode = head; its value equal to x
int currIndex = 1;
while (currNode->data != x) {
prevNode = currNode;
currNode = currNode->next;
currIndex++;
}
if (currNode) {
if (prevNode) {
prevNode->next = currNode->next;
delete currNode;
}
else {
head = currNode->next;
delete currNode;
}
return currIndex;
}
return 0;
}
Deleting a node
int List::DeleteNode(double x) {
Node* prevNode = NULL;
Node* currNode = head;
int currIndex = 1;
while (currNode->data != x) {
prevNode = currNode;
currNode = currNode->next;
currIndex++; prevNode currNode
}
if (currNode) {
if (prevNode) {
prevNode->next = currNode->next;
delete currNode;
}
else {
head = currNode->next;
delete currNode;
}
return currIndex;
}
return 0;
}
Deleting a node
int List::DeleteNode(double x) {
Node* prevNode = NULL;
Node* currNode = head;
int currIndex = 1;
while (currNode->data != x) {
prevNode = currNode;
currNode = currNode->next;
currIndex++;
}
if (currNode) {
if (prevNode) {
prevNode->next = currNode->next;
delete currNode;
}
else {
head = currNode->next;
delete currNode;
}
return currIndex;
} head currNode
return 0;
}
 Printing all the elements
§ void DisplayList()
§ Print the data of all the elements
§ Print the number of the nodes in the list

void List::DisplayList()
{
int num = 0;
Node* currNode = head;
while (currNode != NULL){
cout << currNode->data << endl;
currNode = currNode->next;
num++;
}
cout << "Number of nodes in the list: " << num << endl;
}
 Destroying the list
§ ~List()
§ Use the destructor to release all the memory used by the list.
§ Step through the list and delete each node one by one.

List::~List() {
Node* currNode = head, *nextNode = NULL;
while (currNode != NULL)
{
nextNode = currNode->next;
// destroy the current node
delete currNode;
currNode = nextNode;
}
}
 6
result
Using List
7
5
Number of nodes in the list: 3
5.0 found
4.5 not found
6
int main(void) 5
{ Number of nodes in the list: 2
List list;
list.InsertNode(0, 7.0); // successful
list.InsertNode(1, 5.0); // successful
list.InsertNode(-1, 5.0); // unsuccessful
list.InsertNode(0, 6.0); // successful
list.InsertNode(8, 4.0); // unsuccessful
// print all the elements
list.DisplayList();
if(list.FindNode(5.0) > 0) cout << "5.0 found" << endl;
else cout << "5.0 not found" << endl
if(list.FindNode(4.5) > 0) cout << "4.5 found" << endl;
else cout << "4.5 not found" << endl
list.DeleteNode(7.0);
list.DisplayList();
return 0;
}
0
Some Simple
Algorithms on Linked Lists

§Write a function that returns the length of a

given list.
§Write a Boolean function that tests whether a
given unsorted list of characters is a palindrome.
§Write a function that computes the union of two
sorted linked lists of integers.
The length of a given list:

int length(Node* Head) {

int size = 0;
Node* cur = Head;
while(cur != NULL){
size++;
cur = cur->next;
}
return size;
}
It can also be recursive:
int lengthRec(Node* Head) {
if(Head==NULL)
return 0;
return lengthRec(Head->next) + 1;
}
Test if the given list is a palindrome:

[a b c d d c b a] is a palindrome,
[a b c d c] is not.

bool isPalindrome(Node* head) {

1. create a new list in inverse order, newList
2. check the two lists, head and newList, whether
they are the same
}
Test if the given list is a palindrome:

// copy the list in reverse order

bool isPalindrome(Node* Head)
{
bool result;
Node* newList = NULL;
Node* cur = Head;
while(cur != NULL){
addHead(newList, cur->data);
cur = cur->next;
}

Node* addHead(Node* Head, double newdata)

{
Node* newNode;
newNode->data = newdata;
newNode->next = Head;
return newNode;
}
Test if the given list is a palindrome:

// compare the list and reversed list

result = true; // assume true
cur = Head;
rev = newList;
while(cur!=NULL){
if(cur->data != rev->data)
result = false; // not palindrome!
cur = cur->next;
rev = rev->next;
}
while(newList != NULL)
{ // delete reversed list
cur = newList;
newList = newList->next;
delete cur;
}
return result; // all same; must be palindrome!
}
Union of two sorted lists:
merge([1, 2, 4, 5], [3, 4, 5, 6, 7]) gives
[1, 2, 3, 4, 5, 6, 7]

// returns merged list (changes first list)

Node* merge(Node* Head1, Node* Head2){
Node* Union, Cur;

if(Head1==NULL)
return Head2;
else if(Head2==NULL)
return Head1;
Union = Head1;
Cur = Head2;
while(Cur != NULL){
if(searchNode(Union, Cur->data)==NULL)
insertNode(Union, Cur->data);
Cur = Cur->next;
}
return Union;
}
Union of two sorted lists:
//return the pointer of the node has data =item
//return NULL if item does not exist

Node* searchNode(Node* Head, double item)

{
NodePtr Cur = Head;
while ((Cur != NULL) && (Cur->data != item))
Cur = Cur->next;
return Cur;
}
!TABLE 5-6 Time-complexity of the operations of the class linkedListType

!3
2
 Variations of Linked Lists
§ Circular linked lists
§ The last node points to the first node of the list

A B C

Head
 Variations of Linked Lists
§ Doubly linked lists
§ Each node points to not only successor but the predecessor
§ There are two NULL: at the first and last nodes in the list
§ Advantage: given a node, it is easy to visit its predecessor. Convenient to
traverse lists backwards

Æ A B C Æ

Head
 Array versus Linked Lists

§ Linked lists are more complex to code and manage

than arrays, but they have some distinct advantages.
§ Dynamic: a linked list can easily grow and shrink in size.
§ We don’t need to know how many nodes will be in the list. They are
created in memory as needed.
§ In contrast, the size of a C++ array is fixed at compilation time.
§ Easy and fast insertions and deletions
§ To insert or delete an element in an array, we need to copy to
temporary variables to make room for new elements or close the gap
caused by deleted elements.
§ With a linked list, no need to move other nodes. Only need to reset
some pointers.