UNIT-3
Singly linked list –Operation, Application –representation of a polynomial,
polynomial addition, doubly linked list-Operation.
1.What is a Linked List?
✓ We utilize a linked list data structure to organize data when we have an
unknown amount of data values to work with.
✓ A linked list is a linear data structure that consists of a succession of
elements each of which is connected to the next member in the sequence.
✓ Each element of the Linked List is called a Node.
✓ A Linked List is formed by connecting multiple nodes.
✓ A node consists of two parts,
1. Data
2. Pointer to another node
Data: Data is the actual raw information. It can be a video object, a number, a
character, etc.
Pointer which contains the address of the next node in the memory.
,2. Types of Linked Lists:
1. Singly Linked List – In this type of linked list, one can move or traverse
the linked list in only one direction
2. Doubly Linked List – In this type of linked list, one can move or traverse
the linked list in both directions (Forward and Backward)
3. Circular Linked List – In this type of linked list, the last node of the linked
list contains the link of the first/head node of the linked list in its next
pointer and the first/head node contains the link of the last node of the
linked list in its prev pointer.
, Basic operations on Linked Lists:
1. Deletion
2. Insertion
3. Search
4. Display
3.What is Single Linked List?
✓ Single linked list is a sequence of elements in which every element has link
to its next element in the sequence.
✓ In any single linked list, the individual element is called as "Node".
✓ Every "Node" contains two fields, data field, and the next field.
✓ The data field is used to store actual value of the node and next field is
used to store the address of next node in the sequence.
The graphical representation of a node in a single linked list is as follows...
Operations on Single Linked List
The following operations are performed on a Single Linked List
1. Insertion
2. Deletion
3. Display
Singly linked list –Operation, Application –representation of a polynomial,
polynomial addition, doubly linked list-Operation.
1.What is a Linked List?
✓ We utilize a linked list data structure to organize data when we have an
unknown amount of data values to work with.
✓ A linked list is a linear data structure that consists of a succession of
elements each of which is connected to the next member in the sequence.
✓ Each element of the Linked List is called a Node.
✓ A Linked List is formed by connecting multiple nodes.
✓ A node consists of two parts,
1. Data
2. Pointer to another node
Data: Data is the actual raw information. It can be a video object, a number, a
character, etc.
Pointer which contains the address of the next node in the memory.
,2. Types of Linked Lists:
1. Singly Linked List – In this type of linked list, one can move or traverse
the linked list in only one direction
2. Doubly Linked List – In this type of linked list, one can move or traverse
the linked list in both directions (Forward and Backward)
3. Circular Linked List – In this type of linked list, the last node of the linked
list contains the link of the first/head node of the linked list in its next
pointer and the first/head node contains the link of the last node of the
linked list in its prev pointer.
, Basic operations on Linked Lists:
1. Deletion
2. Insertion
3. Search
4. Display
3.What is Single Linked List?
✓ Single linked list is a sequence of elements in which every element has link
to its next element in the sequence.
✓ In any single linked list, the individual element is called as "Node".
✓ Every "Node" contains two fields, data field, and the next field.
✓ The data field is used to store actual value of the node and next field is
used to store the address of next node in the sequence.
The graphical representation of a node in a single linked list is as follows...
Operations on Single Linked List
The following operations are performed on a Single Linked List
1. Insertion
2. Deletion
3. Display
