Chapter 5 Flashcards
Each link of a linked list can store a data called an element.
Link
Each link of a linked list contains a link to the next link
Next
A Linked List contains the connection link to the first link called First.
LinkedList
can be visualized as a chain of nodes, where every node points to the next node.
Linked list
• Item navigation is forward only.
Simple Linked List
• Items can be navigated forward and backward.
Doubly Linked List
• Last item contains link of the first element as next and the first element has a link to the last element as previous.
Circular Linked List
• Each link of a linked list can store a data called an element.
Link
Each link of a linked list contains a link to the next link
Next
Each link of a linked list contains a link to the previous link
Prev
A Linked List contains the connection link to the first link called First and to the last link called Last.
LinkedList
Adds an element at the beginning of the list.
Insertion
Deletes an element at the beginning of the list.
Deletion
Adds an element at the end of the list.
Insert last
Deletes an element from the end of the list.
Delete last
Adds an element after an item of the list.
Insert After
Deletes an element from the list using the key.
Delete
Displays the complete list in a forward manner.
Display forward
Displays the complete list in a backward manner.
Display backward
a variation of Linked list in which the first element points to the last element and the last element points to the first element.
Circular Linked List
the next pointer of the last node points to the first node
singly linked list
the next pointer of the last node points to the first node and the previous pointer of the first node points to the last node making the circular in both directions.
Doubly linked list
Inserts an element at the start of the list.
insert
Deletes an element from the start of the list.
delete
