Suche senden
Hochladen
358 33 powerpoint-slides_8-linked-lists_chapter-8
âą
16 gefÀllt mir
âą
3,878 views
S
sumitbardhan
Folgen
Reema Thareja Data Structure on Linked List
Weniger lesen
Mehr lesen
Bildung
Technologie
Melden
Teilen
Melden
Teilen
1 von 37
Empfohlen
358 33 powerpoint-slides_10-trees_chapter-10
358 33 powerpoint-slides_10-trees_chapter-10
sumitbardhan
Â
358 33 powerpoint-slides_9-stacks-queues_chapter-9
358 33 powerpoint-slides_9-stacks-queues_chapter-9
sumitbardhan
Â
358 33 powerpoint-slides_11-efficient-binary-trees_chapter-11
358 33 powerpoint-slides_11-efficient-binary-trees_chapter-11
sumitbardhan
Â
Linked List - Insertion & Deletion
Linked List - Insertion & Deletion
Afaq Mansoor Khan
Â
Red black tree
Red black tree
Dr Sandeep Kumar Poonia
Â
358 33 powerpoint-slides_5-arrays_chapter-5
358 33 powerpoint-slides_5-arrays_chapter-5
sumitbardhan
Â
Tree Traversal
Tree Traversal
MdIsrailFakirGUB
Â
Binary Tree in Data Structure
Binary Tree in Data Structure
Meghaj Mallick
Â
Empfohlen
358 33 powerpoint-slides_10-trees_chapter-10
358 33 powerpoint-slides_10-trees_chapter-10
sumitbardhan
Â
358 33 powerpoint-slides_9-stacks-queues_chapter-9
358 33 powerpoint-slides_9-stacks-queues_chapter-9
sumitbardhan
Â
358 33 powerpoint-slides_11-efficient-binary-trees_chapter-11
358 33 powerpoint-slides_11-efficient-binary-trees_chapter-11
sumitbardhan
Â
Linked List - Insertion & Deletion
Linked List - Insertion & Deletion
Afaq Mansoor Khan
Â
Red black tree
Red black tree
Dr Sandeep Kumar Poonia
Â
358 33 powerpoint-slides_5-arrays_chapter-5
358 33 powerpoint-slides_5-arrays_chapter-5
sumitbardhan
Â
Tree Traversal
Tree Traversal
MdIsrailFakirGUB
Â
Binary Tree in Data Structure
Binary Tree in Data Structure
Meghaj Mallick
Â
Binary Search Tree in Data Structure
Binary Search Tree in Data Structure
Dharita Chokshi
Â
Binary tree
Binary tree
Rajendran
Â
B and B+ tree
B and B+ tree
Ashish Arun
Â
Linked list
Linked list
KalaivaniKS1
Â
Binary search tree in data structures
Binary search tree in data structures
chauhankapil
Â
Data Structures with C Linked List
Data Structures with C Linked List
Reazul Islam
Â
Data Structure and Algorithms Linked List
Data Structure and Algorithms Linked List
ManishPrajapati78
Â
358 33 powerpoint-slides_4-introduction-data-structures_chapter-4
358 33 powerpoint-slides_4-introduction-data-structures_chapter-4
sumitbardhan
Â
Doubly Linked List
Doubly Linked List
Ninad Mankar
Â
Avl trees
Avl trees
amna izzat
Â
Doubly linked list (animated)
Doubly linked list (animated)
DivyeshKumar Jagatiya
Â
BINARY SEARCH TREE
BINARY SEARCH TREE
Usha Mahalingam
Â
Binary Search Tree
Binary Search Tree
Abhishek L.R
Â
AVL Tree in Data Structure
AVL Tree in Data Structure
Vrushali Dhanokar
Â
Bfs and Dfs
Bfs and Dfs
Masud Parvaze
Â
Doubly & Circular Linked Lists
Doubly & Circular Linked Lists
Afaq Mansoor Khan
Â
UNIT I LINEAR DATA STRUCTURES â LIST
UNIT I LINEAR DATA STRUCTURES â LIST
Kathirvel Ayyaswamy
Â
Binary tree
Binary tree
Rajendran
Â
Tree traversal techniques
Tree traversal techniques
Mudita Srivastava
Â
358 33 powerpoint-slides_3-pointers_chapter-3
358 33 powerpoint-slides_3-pointers_chapter-3
sumitbardhan
Â
Double linked list
Double linked list
raviahuja11
Â
Data structure using c module 1
Data structure using c module 1
smruti sarangi
Â
Weitere Àhnliche Inhalte
Was ist angesagt?
Binary Search Tree in Data Structure
Binary Search Tree in Data Structure
Dharita Chokshi
Â
Binary tree
Binary tree
Rajendran
Â
B and B+ tree
B and B+ tree
Ashish Arun
Â
Linked list
Linked list
KalaivaniKS1
Â
Binary search tree in data structures
Binary search tree in data structures
chauhankapil
Â
Data Structures with C Linked List
Data Structures with C Linked List
Reazul Islam
Â
Data Structure and Algorithms Linked List
Data Structure and Algorithms Linked List
ManishPrajapati78
Â
358 33 powerpoint-slides_4-introduction-data-structures_chapter-4
358 33 powerpoint-slides_4-introduction-data-structures_chapter-4
sumitbardhan
Â
Doubly Linked List
Doubly Linked List
Ninad Mankar
Â
Avl trees
Avl trees
amna izzat
Â
Doubly linked list (animated)
Doubly linked list (animated)
DivyeshKumar Jagatiya
Â
BINARY SEARCH TREE
BINARY SEARCH TREE
Usha Mahalingam
Â
Binary Search Tree
Binary Search Tree
Abhishek L.R
Â
AVL Tree in Data Structure
AVL Tree in Data Structure
Vrushali Dhanokar
Â
Bfs and Dfs
Bfs and Dfs
Masud Parvaze
Â
Doubly & Circular Linked Lists
Doubly & Circular Linked Lists
Afaq Mansoor Khan
Â
UNIT I LINEAR DATA STRUCTURES â LIST
UNIT I LINEAR DATA STRUCTURES â LIST
Kathirvel Ayyaswamy
Â
Binary tree
Binary tree
Rajendran
Â
Tree traversal techniques
Tree traversal techniques
Mudita Srivastava
Â
358 33 powerpoint-slides_3-pointers_chapter-3
358 33 powerpoint-slides_3-pointers_chapter-3
sumitbardhan
Â
Was ist angesagt?
(20)
Binary Search Tree in Data Structure
Binary Search Tree in Data Structure
Â
Binary tree
Binary tree
Â
B and B+ tree
B and B+ tree
Â
Linked list
Linked list
Â
Binary search tree in data structures
Binary search tree in data structures
Â
Data Structures with C Linked List
Data Structures with C Linked List
Â
Data Structure and Algorithms Linked List
Data Structure and Algorithms Linked List
Â
358 33 powerpoint-slides_4-introduction-data-structures_chapter-4
358 33 powerpoint-slides_4-introduction-data-structures_chapter-4
Â
Doubly Linked List
Doubly Linked List
Â
Avl trees
Avl trees
Â
Doubly linked list (animated)
Doubly linked list (animated)
Â
BINARY SEARCH TREE
BINARY SEARCH TREE
Â
Binary Search Tree
Binary Search Tree
Â
AVL Tree in Data Structure
AVL Tree in Data Structure
Â
Bfs and Dfs
Bfs and Dfs
Â
Doubly & Circular Linked Lists
Doubly & Circular Linked Lists
Â
UNIT I LINEAR DATA STRUCTURES â LIST
UNIT I LINEAR DATA STRUCTURES â LIST
Â
Binary tree
Binary tree
Â
Tree traversal techniques
Tree traversal techniques
Â
358 33 powerpoint-slides_3-pointers_chapter-3
358 33 powerpoint-slides_3-pointers_chapter-3
Â
Andere mochten auch
Double linked list
Double linked list
raviahuja11
Â
Data structure using c module 1
Data structure using c module 1
smruti sarangi
Â
Linked List, Types of Linked LIst, Various Operations, Applications of Linked...
Linked List, Types of Linked LIst, Various Operations, Applications of Linked...
Balwant Gorad
Â
6. Linked list - Data Structures using C++ by Varsha Patil
6. Linked list - Data Structures using C++ by Varsha Patil
widespreadpromotion
Â
Linked list
Linked list
akshat360
Â
linked list
linked list
Narendra Chauhan
Â
7 Myths of AI
7 Myths of AI
CrowdFlower
Â
Array implementation and linked list as datat structure
Array implementation and linked list as datat structure
Tushar Aneyrao
Â
Linked list
Linked list
Trupti Agrawal
Â
Searching and Sorting Techniques in Data Structure
Searching and Sorting Techniques in Data Structure
Balwant Gorad
Â
Trees data structure
Trees data structure
Sumit Gupta
Â
Doubly linked list
Doubly linked list
Fahd Allebdi
Â
Cyber Crime
Cyber Crime
Abhishek L.R
Â
Insertion and Deletion in Binary Search Trees (using Arrays and Linked Lists)
Insertion and Deletion in Binary Search Trees (using Arrays and Linked Lists)
Lovelyn Rose
Â
Individual-In-The-Loop (for Ethically Aligned Artificial Intelligence)
Individual-In-The-Loop (for Ethically Aligned Artificial Intelligence)
John C. Havens
Â
Open Legal Data Workshop at Stanford
Open Legal Data Workshop at Stanford
Harry Surden
Â
Harry Surden - Artificial Intelligence and Law Overview
Harry Surden - Artificial Intelligence and Law Overview
Harry Surden
Â
AI and Machine Learning Demystified by Carol Smith at Midwest UX 2017
AI and Machine Learning Demystified by Carol Smith at Midwest UX 2017
Carol Smith
Â
Andere mochten auch
(18)
Double linked list
Double linked list
Â
Data structure using c module 1
Data structure using c module 1
Â
Linked List, Types of Linked LIst, Various Operations, Applications of Linked...
Linked List, Types of Linked LIst, Various Operations, Applications of Linked...
Â
6. Linked list - Data Structures using C++ by Varsha Patil
6. Linked list - Data Structures using C++ by Varsha Patil
Â
Linked list
Linked list
Â
linked list
linked list
Â
7 Myths of AI
7 Myths of AI
Â
Array implementation and linked list as datat structure
Array implementation and linked list as datat structure
Â
Linked list
Linked list
Â
Searching and Sorting Techniques in Data Structure
Searching and Sorting Techniques in Data Structure
Â
Trees data structure
Trees data structure
Â
Doubly linked list
Doubly linked list
Â
Cyber Crime
Cyber Crime
Â
Insertion and Deletion in Binary Search Trees (using Arrays and Linked Lists)
Insertion and Deletion in Binary Search Trees (using Arrays and Linked Lists)
Â
Individual-In-The-Loop (for Ethically Aligned Artificial Intelligence)
Individual-In-The-Loop (for Ethically Aligned Artificial Intelligence)
Â
Open Legal Data Workshop at Stanford
Open Legal Data Workshop at Stanford
Â
Harry Surden - Artificial Intelligence and Law Overview
Harry Surden - Artificial Intelligence and Law Overview
Â
AI and Machine Learning Demystified by Carol Smith at Midwest UX 2017
AI and Machine Learning Demystified by Carol Smith at Midwest UX 2017
Â
Ăhnlich wie 358 33 powerpoint-slides_8-linked-lists_chapter-8
Ch-17-Data Structures.ppt.pptx
Ch-17-Data Structures.ppt.pptx
coderasylem
Â
cp264_lecture13_14_linkedlist.ppt
cp264_lecture13_14_linkedlist.ppt
ssuser9dd05f
Â
Introduction Linked Lists - Singly Linked List,
Introduction Linked Lists - Singly Linked List,
JayaKamal
Â
ds 4Linked lists.ppt
ds 4Linked lists.ppt
AlliVinay1
Â
unit 2- PPT.pdf
unit 2- PPT.pdf
PranavMakwana6
Â
5.Linked list
5.Linked list
Mandeep Singh
Â
4.linked list(contd.)
4.linked list(contd.)
Chandan Singh
Â
DSModule2.pptx
DSModule2.pptx
ChrisSosaJacob
Â
Stacks
Stacks
amitphadikar2012
Â
cp264_lecture18_queue.ppt
cp264_lecture18_queue.ppt
ssuserff72e4
Â
Lecture 5 data structures and algorithms
Lecture 5 data structures and algorithms
Aakash deep Singhal
Â
Linklist
Linklist
SHEETAL WAGHMARE
Â
Link list(by harshit)
Link list(by harshit)
Harshit Jain
Â
Bca data structures linked list mrs.sowmya jyothi
Bca data structures linked list mrs.sowmya jyothi
Sowmya Jyothi
Â
Unit 2 linked list and queues
Unit 2 linked list and queues
kalyanineve
Â
Chapter 3 Linkedlist Data Structure .pdf
Chapter 3 Linkedlist Data Structure .pdf
Axmedcarb
Â
linkrd_list.pdf
linkrd_list.pdf
ISHAN194169
Â
10994103.ppt
10994103.ppt
SushmaG48
Â
Unit 5 linked list
Unit 5 linked list
Dabbal Singh Mahara
Â
DS_LinkedList.pptx
DS_LinkedList.pptx
msohail37
Â
Ăhnlich wie 358 33 powerpoint-slides_8-linked-lists_chapter-8
(20)
Ch-17-Data Structures.ppt.pptx
Ch-17-Data Structures.ppt.pptx
Â
cp264_lecture13_14_linkedlist.ppt
cp264_lecture13_14_linkedlist.ppt
Â
Introduction Linked Lists - Singly Linked List,
Introduction Linked Lists - Singly Linked List,
Â
ds 4Linked lists.ppt
ds 4Linked lists.ppt
Â
unit 2- PPT.pdf
unit 2- PPT.pdf
Â
5.Linked list
5.Linked list
Â
4.linked list(contd.)
4.linked list(contd.)
Â
DSModule2.pptx
DSModule2.pptx
Â
Stacks
Stacks
Â
cp264_lecture18_queue.ppt
cp264_lecture18_queue.ppt
Â
Lecture 5 data structures and algorithms
Lecture 5 data structures and algorithms
Â
Linklist
Linklist
Â
Link list(by harshit)
Link list(by harshit)
Â
Bca data structures linked list mrs.sowmya jyothi
Bca data structures linked list mrs.sowmya jyothi
Â
Unit 2 linked list and queues
Unit 2 linked list and queues
Â
Chapter 3 Linkedlist Data Structure .pdf
Chapter 3 Linkedlist Data Structure .pdf
Â
linkrd_list.pdf
linkrd_list.pdf
Â
10994103.ppt
10994103.ppt
Â
Unit 5 linked list
Unit 5 linked list
Â
DS_LinkedList.pptx
DS_LinkedList.pptx
Â
Mehr von sumitbardhan
358 33 powerpoint-slides_15-hashing-collision_chapter-15
358 33 powerpoint-slides_15-hashing-collision_chapter-15
sumitbardhan
Â
358 33 powerpoint-slides_14-sorting_chapter-14
358 33 powerpoint-slides_14-sorting_chapter-14
sumitbardhan
Â
358 33 powerpoint-slides_13-graphs_chapter-13
358 33 powerpoint-slides_13-graphs_chapter-13
sumitbardhan
Â
358 33 powerpoint-slides_12-heaps_chapter-12
358 33 powerpoint-slides_12-heaps_chapter-12
sumitbardhan
Â
358 33 powerpoint-slides_7-structures_chapter-7
358 33 powerpoint-slides_7-structures_chapter-7
sumitbardhan
Â
358 33 powerpoint-slides_6-strings_chapter-6
358 33 powerpoint-slides_6-strings_chapter-6
sumitbardhan
Â
358 33 powerpoint-slides_2-functions_chapter-2
358 33 powerpoint-slides_2-functions_chapter-2
sumitbardhan
Â
358 33 powerpoint-slides_1-introduction-c_chapter-1
358 33 powerpoint-slides_1-introduction-c_chapter-1
sumitbardhan
Â
358 33 powerpoint-slides_16-files-their-organization_chapter-16
358 33 powerpoint-slides_16-files-their-organization_chapter-16
sumitbardhan
Â
Algorithm analysis
Algorithm analysis
sumitbardhan
Â
Mehr von sumitbardhan
(10)
358 33 powerpoint-slides_15-hashing-collision_chapter-15
358 33 powerpoint-slides_15-hashing-collision_chapter-15
Â
358 33 powerpoint-slides_14-sorting_chapter-14
358 33 powerpoint-slides_14-sorting_chapter-14
Â
358 33 powerpoint-slides_13-graphs_chapter-13
358 33 powerpoint-slides_13-graphs_chapter-13
Â
358 33 powerpoint-slides_12-heaps_chapter-12
358 33 powerpoint-slides_12-heaps_chapter-12
Â
358 33 powerpoint-slides_7-structures_chapter-7
358 33 powerpoint-slides_7-structures_chapter-7
Â
358 33 powerpoint-slides_6-strings_chapter-6
358 33 powerpoint-slides_6-strings_chapter-6
Â
358 33 powerpoint-slides_2-functions_chapter-2
358 33 powerpoint-slides_2-functions_chapter-2
Â
358 33 powerpoint-slides_1-introduction-c_chapter-1
358 33 powerpoint-slides_1-introduction-c_chapter-1
Â
358 33 powerpoint-slides_16-files-their-organization_chapter-16
358 33 powerpoint-slides_16-files-their-organization_chapter-16
Â
Algorithm analysis
Algorithm analysis
Â
KĂŒrzlich hochgeladen
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentation
camerronhm
Â
Unit-IV- Pharma. Marketing Channels.pptx
Unit-IV- Pharma. Marketing Channels.pptx
VishalSingh1417
Â
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
KarakKing
Â
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
ciinovamais
Â
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
Nirmal Dwivedi
Â
Towards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptx
Jisc
Â
Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes
Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes
Celine George
Â
On National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan Fellows
Mebane Rash
Â
Dyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptx
callscotland1987
Â
Understanding Accommodations and Modifications
Understanding Accommodations and Modifications
MJDuyan
Â
Application orientated numerical on hev.ppt
Application orientated numerical on hev.ppt
RamjanShidvankar
Â
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
Ramakrishna Reddy Bijjam
Â
Fostering Friendships - Enhancing Social Bonds in the Classroom
Fostering Friendships - Enhancing Social Bonds in the Classroom
Pooky Knightsmith
Â
1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
QucHHunhnh
Â
ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptx
AreebaZafar22
Â
Graduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - English
neillewis46
Â
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
jbellavia9
Â
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
Poh-Sun Goh
Â
Single or Multiple melodic lines structure
Single or Multiple melodic lines structure
dhanjurrannsibayan2
Â
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
QucHHunhnh
Â
KĂŒrzlich hochgeladen
(20)
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentation
Â
Unit-IV- Pharma. Marketing Channels.pptx
Unit-IV- Pharma. Marketing Channels.pptx
Â
Salient Features of India constitution especially power and functions
Salient Features of India constitution especially power and functions
Â
Activity 01 - Artificial Culture (1).pdf
Activity 01 - Artificial Culture (1).pdf
Â
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
UGC NET Paper 1 Mathematical Reasoning & Aptitude.pdf
Â
Towards a code of practice for AI in AT.pptx
Towards a code of practice for AI in AT.pptx
Â
Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes
Mixin Classes in Odoo 17 How to Extend Models Using Mixin Classes
Â
On National Teacher Day, meet the 2024-25 Kenan Fellows
On National Teacher Day, meet the 2024-25 Kenan Fellows
Â
Dyslexia AI Workshop for Slideshare.pptx
Dyslexia AI Workshop for Slideshare.pptx
Â
Understanding Accommodations and Modifications
Understanding Accommodations and Modifications
Â
Application orientated numerical on hev.ppt
Application orientated numerical on hev.ppt
Â
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
Â
Fostering Friendships - Enhancing Social Bonds in the Classroom
Fostering Friendships - Enhancing Social Bonds in the Classroom
Â
1029 - Danh muc Sach Giao Khoa 10 . pdf
1029 - Danh muc Sach Giao Khoa 10 . pdf
Â
ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptx
Â
Graduate Outcomes Presentation Slides - English
Graduate Outcomes Presentation Slides - English
Â
Sociology 101 Demonstration of Learning Exhibit
Sociology 101 Demonstration of Learning Exhibit
Â
Micro-Scholarship, What it is, How can it help me.pdf
Micro-Scholarship, What it is, How can it help me.pdf
Â
Single or Multiple melodic lines structure
Single or Multiple melodic lines structure
Â
1029-Danh muc Sach Giao Khoa khoi 6.pdf
1029-Danh muc Sach Giao Khoa khoi 6.pdf
Â
358 33 powerpoint-slides_8-linked-lists_chapter-8
1.
© Oxford University
Press 2011. All rights reserved. Data Structures Using CData Structures Using C Reema TharejaReema Thareja, Assistant Professor, Institute of Information Technology and Management, New Delhi
2.
© Oxford University
Press 2011. All rights reserved. CHAPTER 8 LINKED LISTS
3.
© Oxford University
Press 2011. All rights reserved. INTRODUCTION âą A linked list in simple terms is a linear collection of data elements. These data elements are called nodes. âą Linked list is a data structure which in turn can be used to implement other data structures. Thus, it acts as building block to implement data structures like stacks, queues and their variations. âą A linked list can be perceived as a train or a sequence of nodes in which each node contain one or more data fields and a pointer to the next node. 1 2 3 4 5 6 7 X START In the above linked list, every node contains two parts- one integer and the other a pointer to the next node. The left part of the node which contains data may include a simple data type, an array or a structure. The right part of the node contains a pointer to the next node (or address of the next node in sequence). The last node will have no next node connected to it, so it will store a special value called NULL.
4.
© Oxford University
Press 2011. All rights reserved. INTRODUCTION contd. âą Linked list contains a pointer variable, START which stores the address of the first node in the list. âą We can traverse the entire list using a single pointer variable START. The START node will contain the address of the first node; the next part of the first node will in turn store the address of its succeeding node. âą Using this technique the individual nodes of the list will form a chain of nodes. If START = NULL, this means that the linked list is empty and contains no nodes. âą In C, we will implement a linked list using the following code: âą struct node âą { âą int data; âą struct node *next; âą };
5.
© Oxford University
Press 2011. All rights reserved. 1 DATA NEXT H 4 E 7 L 8 L 10 O -1 1 2 3 4 5 6 7 8 9 10 START START pointing to the first element of the linked list in memory 9 AVAIL If we want to add a node to an already existing linked list in the memory, we will first find any free space in the memory and then use it to store the information. The operating system maintains a free pool which is a linked list of a of all free memory cells. It maintains a pointer variable AVAIL which stores the address of the first free space. When you delete a node from the linked list, the operating system adds the freed memory to the free pool. The operating system will perform this operation whenever it finds the CPU idle or whenever the programs are falling short of memory. The operating system scans through all the memory cells and mark the cells that are being used by some or the other program. Then, it collects all those cells which are not being used and add their address to the free pool so that it can be reused by the programs. This process is called garbage collection. The whole process of collecting unused memory cells (garbage collection) is transparent to the programmer.
6.
© Oxford University
Press 2011. All rights reserved. Singly Linked List âą A singly linked list is the simplest type of linked list in which every node contains some data and a pointer to the next node of the same data type. By saying that the node contains a pointer to the next node we mean that the node stores the address of the next node in sequence. 1 2 3 4 5 6 7 X START Algorithm for traversing a linked list Step 1: [INITIALIZE] SET PTR = START Step 2: Repeat Steps 3 and 4 while PTR != NULL Step 3: Apply Process to PTR->DATA Step 4: SET PTR = PTR->NEXT [END OF LOOP] Step 5: EXIT
7.
© Oxford University
Press 2011. All rights reserved. Algorithm to print the information stored in each node of the linked list Step 1: [INITIALIZE] SET PTR = START Step 2: Repeat Steps 3 and 4 while PTR != NULL Step 3: Write PTR->DATA Step 4: SET PTR = PTR->NEXT [END OF LOOP] Step 5: EXIT Algorithm to print the number of nodes in the linked list Step 1: [INITIALIZE] SET Count = 0 Step 2: [INITIALIZE] SET PTR = START Step 3: Repeat Steps 4 and 5 while PTR != NULL Step 4: SET Count = Count + 1 Step 5: SET PTR = PTR->NEXT [END OF LOOP] Step 6: EXIT
8.
© Oxford University
Press 2011. All rights reserved. Algorithm to search an unsorted linked list Step 1: [INITIALIZE] SET PTR = START Step 2: Repeat Steps 3 while PTR != NULL Step 3: IF VAL = PTR->DATA SET POS = PTR Go To Step 5 ELSE SET PTR = PTR->NEXT [END OF IF] [END OF LOOP] Step 4: SET POS = NULL Step 5: EXIT 1 7 3 4 2 6 5 X PTR 1 7 3 4 2 6 5 X PTR 1 7 3 4 2 6 5 X PTR 1 7 3 4 2 6 5 X PTR
9.
© Oxford University
Press 2011. All rights reserved. 1 7 3 4 2 6 5 X START START Algorithm to insert a new node in the beginning of the linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 7 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET New_Node->Next = START Step 6: SET START = New_Node Step 7: EXIT 9 1 7 3 4 2 6 5 X
10.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node at the end of the linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 10 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET New_Node->Next = NULL Step 6: SET PTR = START Step 7: Repeat Step 8 while PTR->NEXT != NULL Step 8: SET PTR = PTR ->NEXT [END OF LOOP] Step 9: SET PTR->NEXT = New_Node Step 10: EXIT 1 7 3 4 2 6 5 X START, PTR 1 7 3 4 2 6 5 9 X PTRSTART
11.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node after a node that has value NUM Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 12 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET PTR = START Step 6: SET PREPTR = PTR Step 7: Repeat Step 8 and 9 while PREPTR->DATA != NUM Step 8: SET PREPTR = PTR Step 9: SET PTR = PTR->NEXT [END OF LOOP] Step 10: PREPTR->NEXT = New_Node Step 11: SET New_Node->NEXT = PTR Step 12: EXIT 51 7 3 4 2 6 X START, PTR, PREPTR 1 7 3 4 2 6 5 X START PREPTR PTR 1 7 3 9 4 2 6 5 X START
12.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the first node from the linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 5 [END OF IF] Step 2: SET PTR = START Step 3: SET START = START->NEXT Step 4: FREE PTR Step 5: EXIT 1 7 3 4 2 6 5 X 7 3 4 2 6 5 X START START
13.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the last node of the linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 8 [END OF IF] Step 2: SET PTR = START Step 3: Repeat Step 4 and 5 while PTR->NEXT != NULL Step 4: SET PREPTR = PTR Step 5: SET PTR = PTR->NEXT [END OF LOOP] Step 6: SET PREPTR->NEXT = NULL Step 7: FREE PTR Step 8: EXIT 1 7 3 4 2 6 5 X START, PREPTR, PTR 1 7 3 4 2 6 X 5 X PREPTR PTRSTART
14.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the node after a given node from the linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 10 [END OF IF] Step 2: SET PTR = START Step 3: SET PREPTR = PTR Step 4: Repeat Step 5 and 6 while PRETR->DATA != NUM Step 5: SET PREPTR = PTR Step 6: SET PTR = PTR->NEXT [END OF LOOP] Step7: SET TEMP = PTR->NEXT Step 8: SET PREPTR->NEXT = TEMP->NEXT Step 9: FREE TEMP Step 10: EXIT 1 7 3 4 2 6 5 X START, PREPTR, PTR 1 7 3 4 2 6 5 X PREPTR PTRSTART 1 7 3 4 2 6 5 X START 1 7 3 4 6 5 X START
15.
© Oxford University
Press 2011. All rights reserved. Circular Linked List âą In a circular linked list, the last node contains a pointer to the first node of the list. We can have a circular singly listed list as well as circular doubly linked list. While traversing a circular linked list, we can begin at any node and traverse the list in any direction forward or backward until we reach the same node where we had started. Thus, a circular linked list has no beginning and no ending. 1 2 3 4 5 6 7 START
16.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node in the beginning of circular the linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 7 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET PTR = START Step 6: Repeat Step 7 while PTR->NEXT != START Step 7: PTR = PTR->NEXT Step 8: SET New_Node->Next = START Step 8: SET PTR->NEXT = New_Node Step 6: SET START = New_Node Step 7: EXIT 1 7 3 4 2 6 5 START, PTR 1 7 3 4 2 6 5 START PTR 9 1 7 3 4 2 6 5 START
17.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node at the end of the circular linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 7 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET New_Node->Next = START Step 6: SET PTR = START Step 7: Repeat Step 8 while PTR->NEXT != START Step 8: SET PTR = PTR ->NEXT [END OF LOOP] Step 9: SET PTR ->NEXT = New_Node Step 10: EXIT 1 7 3 4 2 6 5 START, PTR 1 7 3 4 2 6 5 9 START PTR
18.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node after a node that has value NUM Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 12 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET PTR = START Step 6: SET PREPTR = PTR Step 7: Repeat Step 8 and 9 while PTR->DATA != NUM Step 8: SET PREPTR = PTR Step 9: SET PTR = PTR->NEXT [END OF LOOP] Step 10: PREPTR->NEXT = New_Node Step 11: SET New_Node->NEXT = PTR Step 12: EXIT 1 7 3 4 2 6 5 START, PTR, PREPTR 1 7 3 4 2 6 5 9 START PRE PTR PTR 1 7 3 9 4 2 6 5
19.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the first node from the circular linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 8 [END OF IF] Step 2: SET PTR = START Step 3: Repeat Step 4 while PTR->NEXT != START Step 4: SET PTR = PTR->NEXT [END OF IF] Step 5: SET PTR->NEXT = START->NEXT Step 6: FREE START Step 7: SET START = PTR->NEXT Step 8: EXIT 1 7 3 4 2 6 5 START, PTR 1 7 3 4 2 6 5 START PTR 7 3 4 2 6 5 START
20.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the last node of the circular linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 8 [END OF IF] Step 2: SET PTR = START Step 3: Repeat Step 4 while PTR->NEXT != START Step 4: SET PREPTR = PTR Step 5: SET PTR = PTR->NEXT [END OF LOOP] Step 6: SET PREPTR->NEXT = START Step 7: FREE PTR Step 8: EXIT 1 7 3 4 2 6 5 START, PREPTR, PTR 1 7 3 4 2 6 5 START PTR PREPTR 1 7 3 4 2 6 START
21.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the node after a given node from the circular linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 9 [END OF IF] Step 2: SET PTR = START Step 3: SET PREPTR = PTR Step 4: Repeat Step 5 and 6 while PREPTR->DATA != NUM Step 5: SET PREPTR = PTR Step 6: SET PTR = PTR->NEXT [END OF LOOP] Step 7: SET PREPTR->NEXT = PTR->NEXT Step 8: FREE PTR Step 9: EXIT 1 7 3 4 2 6 5 START, PREPTR, PTR 1 7 3 4 2 6 5 START PREPTR PTR 1 7 3 4 6 5 START
22.
© Oxford University
Press 2011. All rights reserved. Doubly Linked List A doubly linked list or a two way linked list is a more complex type of linked list which contains a pointer to the next as well as previous node in the sequence. Therefore, it consists of three parts and not just two. The three parts are data, a pointer to the next node and a pointer to the previous node 1X 1 2 3 4 X START In C language, the structure of a doubly linked list is given as, struct node { struct node *prev; int data; struct node *next; }; The prev field of the first node and the next field of the last node will contain NULL. The prev field is used to store the address of the preceding node. This would enable to traverse the list in the backward direction as well.
23.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node in the beginning of the doubly linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 8 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET New_Node->PREV = NULL Step 6: SET New_Node->Next = START Step 7: SET START = New_Node Step 8: EXIT 1 7 3 4 2 XX 9 1 7 3 4X 2 X START START
24.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node at the end of the doubly linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 11 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET New_Node->Next = NULL Step 6: SET PTR = START Step 7: Repeat Step 8 while PTR->NEXT != NULL Step 8: SET PTR = PTR->NEXT [END OF LOOP] Step 9: SET PTR->NEXT = New_Node Step 10: New_Node->PREV = PTR Step 11: EXIT 1 7 3 4 2 XX START, PTR 1 7 3 4 2X 9 X START PTR
25.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node after a node that has value NUM Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 11 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET PTR = START Step 6: Repeat Step 8 while PTR->DATA != NUM Step 7: SET PTR = PTR->NEXT [END OF LOOP] Step 8: New_Node->NEXT = PTR->NEXT Step 9: SET New_Node->PREV = PTR Step 10: SET PTR->NEXT = New_Node Step 11: EXIT 1 7 3 4 2 XX START, PTR 1 7 3 4 2 XX 9 1 7 3 9 4X 2 X START START PTR
26.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the first node from the doubly linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 6 [END OF IF] Step 2: SET PTR = START Step 3: SET START = START->NEXT Step 4: SET START->PREV = NULL Step 5: FREE PTR Step 6: EXIT 1 7 3 4 2 XX START, PTR 7 3 4 2 X
27.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the last node of the doubly linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 7 [END OF IF] Step 2: SET PTR = START Step 3: Repeat Step 4 and 5 while PTR->NEXT != NULL Step 4: SET PTR = PTR->NEXT [END OF LOOP] Step 5: SET PTR->PREV->NEXT = NULL Step 6: FREE PTR Step 7: EXIT 1 3 5 7 8X 9 1 X START, PTR 1 3 5 7 8X 9 1 X START PTR 1 3 5 7 8 XX START
28.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the node after a given node from the doubly linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 9 [END OF IF] Step 2: SET PTR = START Step 3: Repeat Step 4 while PTR->DATA != NUM Step 4: SET PTR = PTR->NEXT [END OF LOOP] Step 5: SET TEMP = PTR->NEXT Step 6: SET PTR->NEXT = TEMP->NEXT Step 7: SET TEMP->NEXT->PREV = PTR Step 8: FREE TEMP Step 9: EXIT 1 3 4 7 8X 9 1 X 1 3 4 7 8X 9 1 X 1 3 4 8 9 XX START, PTR START PTR START
29.
© Oxford University
Press 2011. All rights reserved. Circular Doubly Linked List âą A circular doubly linked list or a circular two way linked list is a more complex type of linked list which contains a pointer to the next as well as previous node in the sequence. âą The difference between a doubly linked and a circular doubly linked list is same as that exists between a singly linked list and a circular linked list. The circular doubly linked list does not contain NULL in the previous field of the first node and the next field of the last node. Rather, the next field of the last node stores the address of the first node of the list, i.e; START. Similarly, the previous field of the first field stores the address of the last node. âą Since a circular doubly linked list contains three parts in its structure, it calls for more space per node and for more expensive basic operations. However, it provides the ease to manipulate the elements of the list as it maintains pointers to nodes in both the directions . The main advantage of using a circular doubly linked list is that it makes searches twice as efficient. 1 1 2 3 4 START
30.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node in the beginning of the circular doubly linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 12 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 6: SET START->PREV->NEXT = new_node; Step 7: SET New_Node->PREV = START->PREV; Step 8: SET START->PREV= new_Node; Step 9: SET new_node->next = START; Step 10: SET START = New_Node Step 11: EXIT 1 7 3 4 2 START 9 1 7 3 4 2 START
31.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node at the end of the circular doubly linked list Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 11 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET New_Node->Next = START Step 6: SET New_Node->PREV = START->PREV Step 7: EXIT 1 7 3 4 2 1 7 3 4 2 9 START START
32.
© Oxford University
Press 2011. All rights reserved. Algorithm to insert a new node after a node that has value NUM Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 11 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET New_Node->DATA = VAL Step 5: SET PTR = START Step 6: Repeat Step 8 while PTR->DATA != NUM Step 7: SET PTR = PTR->NEXT [END OF LOOP] Step 8: New_Node->NEXT = PTR->NEXT Step 9: SET PTR->NEXT->PREV = New_Node Step 9: SET New_Node->PREV = PTR Step 10: SET PTR->NEXT = New_Node Step 11: EXIT 1 7 3 4 2 START, PTR 1 7 3 4 2 9START PTR 1 7 3 9 4 2 START
33.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the first node from the circular doubly linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 8 [END OF IF] Step 2: SET PTR = START Step 3: SET PTR->PREV=>NEXT= PTR->NEXT Step 4: SET PTR->NEXT->PREV = PTR->PREV Step 5: SET START = START->NEXT Step 6: FREE PTR Step 7: EXIT 1 3 5 7 8 9 1 START, PTR 3 5 7 8 9 1 START
34.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the last node of the circular doubly linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 8 [END OF IF] Step 2: SET PTR = START->PREV Step 5: SET PTR->PREV->NEXT = START Step 6: SET START->PREV = PTR->PREV Step 7: FREE PTR Step 8: EXIT 1 3 5 7 8 9 1 START PTR 1 3 5 7 8X START
35.
© Oxford University
Press 2011. All rights reserved. Algorithm to delete the node after a given node from the circular doubly linked list Step 1: IF START = NULL, then Write UNDERFLOW Go to Step 9 [END OF IF] Step 2: SET PTR = START Step 3: Repeat Step 4 while PTR->DATA != NUM Step 4: SET PTR = PTR->NEXT [END OF LOOP] Step 5: SET TEMP = PTR->NEXT Step 6: SET PTR->NEXT = TEMP->NEXT Step 7: SET TEMP->NEXT->PREV = PTR Step 8: FREE TEMP Step 9: EXIT 1 3 5 7 8 9 1 START 1 3 5 7 8 9 1 START PTR 1 3 4 8 9 START
36.
© Oxford University
Press 2011. All rights reserved. Header Linked List âą A header linked list is a special type of linked list which contains a header node at the beginning of the list. So, in a header linked list START will not point to the first node of the list but START will contain the address of the header node. There are basically two variants of a header linked list- âą Grounded header linked list which stores NULL in the next field of the last node âą Circular header linked list which stores the address of the header node in the next field of the last node. Here, the header node will denote the end of the list. 1 2 3 4 5 6 X Header Node START 1 2 3 4 5 6 Header Node START
37.
© Oxford University
Press 2011. All rights reserved. Algorithm to traverse a Circular Header Linked List Step 1: SET PTR = START->NEXT Step 2: Repeat Steps 3 and 4 while PTR != START Step 3: Apply PROCESS to PTR->DATA Step 4: SET PTR = PTR->NEXT [END OF LOOP] Step 5: EXIT Algorithm to insert a new node after a given node Step 1: IF AVAIL = NULL, then Write OVERFLOW Go to Step 10 [END OF IF] Step 2: SET New_Node = AVAIL Step 3: SET AVAIL = AVAIL->NEXT Step 4: SET PTR = START->NEXT Step 5: SET New_Node->DATA = VAL Step 6: Repeat step 4 while PTR->DATA != NUM Step 7: SET PTR = PTR->NEXT [END OF LOOP] Step 8: New_Node->NEXT = PTR->NEXT Step 9: SET PTR->NEXT = New_Node Step 10: EXIT