## Exchange first and last nodes in Circular Linked List

Given a Circular linked list exchange the first and the last node. The task should be done with only one extra node, you can not… Read More »

Given a Circular linked list exchange the first and the last node. The task should be done with only one extra node, you can not… Read More »

Given a singly linked list, we have to convert it into circular linked list. For example, we have been given a singly linked list with… Read More »

There are n people standing in a circle waiting to be executed. The counting out begins at some point in the circle and proceeds around… Read More »

Given a circular linked list, count number of nodes in it. For example output is 5 for below list. Recommended: Please try your approach on… Read More »

Prerequisite – Circular Singly Linked List We have discussed basics and how to implement circular queue using array in set 1. Circular Queue | Set… Read More »

We have discussed doubly circular linked list introduction and its insertion. Let us formulate the problem statement to understand the deletion process. Given a ‘key’,… Read More »

We have already discussed about circular linked list and traversal in a circular linked list in the below articles: Introduction to circular linked list Traversal… Read More »

Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends.In previous post we had… Read More »

We have discussed Singly and Circular Linked List in the following post: Singly Linked List Circular Linked List Why Circular? In a singly linked list,… Read More »

Given a Binary Tree, convert it to a Circular Doubly Linked List (In-Place). The left and right pointers in nodes are to be used as… Read More »

Given a singly linked list, find if the linked list is circular or not. A linked list is called circular if it not NULL terminated… Read More »

We have discussed Circular Linked List Introduction and Applications, in the previous post on Circular Linked List. In this post, traversal operation is discussed.

We have discussed singly and doubly linked lists in the following posts. Introduction to Linked List & Insertion

Difficulty Level: Rookie Write a C function to insert a new value in a sorted Circular Linked List (CLL). For example, if the input CLL… Read More »

Asked by Bharani