# Tag Archives: circular linked list

Given a circular linked list, count the number of nodes in it. For example, the output is 5 for the below list.  Recommended: Please try… 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’, delete… Read More
We have already discussed circular linked list and traversal in a circular linked list in the below articles: Introduction to circular linked list Traversal in a circular… 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, for accessing… 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 is 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.    … Read More
We have discussed singly and doubly linked lists in the following posts. Introduction to Linked List & Insertion Doubly Linked List Introduction and Insertion Circular… Read More
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 is… Read More
Original Linked List Result Linked List 1 Result Linked List 2 If there are odd number of nodes, then first list should contain one extra.… Read More
Asked by Varun Bhatia. Question: Write a recursive function treeToList(Node root) that takes an ordered binary tree and rearranges the internal pointers to make a… Read More