Topics

64

Map in Data Structure 1 Map in Data Structure

Dictionary in Data Structure 1 Dictionary in Data Structure

Array 1 Array Introduction in Data Structure 2 Two-dimension Array in Data Structure 3 Multi-dimensional Array 4 Operations on Array 5 Traversal 6 Selection 7 Insertion 8 Deletion

Linked List 1 Linked List Introduction 2 Array and Linked List 3 Singly linked list 4 Doubly linked list 5 Circular linked list

Linked List Program in Java — Step by Step Explanation 1 Linked List Program in Java — Step by Step Explanation 2 Delete a Node from a Linked List in Java — Step by Step Explanation 3 Traversal in Linked List in Java — Step by Step Explanation 4 Searching in a Linked List in Java — Step by Step Explanation 5 Concatenation of Two Linked Lists in Java — Step by Step Explanation 6 Splitting a Linked List in Java — Step by Step Explanation 7 Reversal of a Linked List in Java — Complete Explanation

Stack Data Structure 1 Stack Data Structure Introduction 2 Stack operations and Implementation 3 Stack implementation using Linked List 4 Polish Notation 5 Postfix Evaluation Algorithm 6 Infix to Postfix Conversion 7 Infix to Prefix Conversion

Queue Data Structure 1 Queue Introduction 2 Queue Implementation using Structure 3 Queue Implementation using Array 4 Queue Implementation using Linked List 5 Priority Queue Implementation using Array 6 Queue Implementation using Stack 7 Circular Queue

Searching 1 Linear Search 2 Binary Search

Tree 1 Tree Introduction 2 Types of tree 3 Binary Tree 4 Complete Binary Tree 5 level and height of the tree 6 Skewed Binary Tree 7 Extended Binary Tree 8 AVL Tree

Graph 1 Graph in Data Structure 2 Representation of Graphs 3 Graph Terminology

Sorting 1 Selection Sort 2 Merge Sort 3 Quick Sort 4 Insertion Sort 5 Bubble Sort 6 Heap sort 7 Bucket sort

Data Structure Introduction 1 About DSA 2 What is Data Structure 3 Various Data structures 4 Various Data structures operations 5 Time Complexity 6 Space Complexity 7 Algorithm Design Techniques 8 What is Algorithm?

No topics found for your search.

Table of Contents

Circular Linked List in Data Structures: Definition and Operations

Rumman Ansari July 05, 2024 7,551 views

Circular Linked List in Data Structures: Definition and Operations

Circular Linked List

Circular Linked List is Divided into 2 Categories .
- I. Singly Circular Linked List
- II. Doubly Circular Linked List
In Circular Linked List Address field of Last node contain address of “First Node“.
In short First Node and Last Nodes are adjacent .
Linked List is made circular by linking first and last node , so it looks like circular chain [ shown in Following diagram ].
Two way access is possible only if we are using “Doubly Circular Linked List”
Sequential movement is possible
No direct access is allowed.

Singly Circular Linked List:

Singly Circular Linked List

Doubly Circular Linked List:

Doubly Circular Linked List