## Convert a given Binary Tree to Circular Doubly Linked List | Set 2

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

- Print the last k nodes of the linked list in reverse order | Recursive approach
- Pairwise swap adjacent nodes of a linked list by changing pointers | Set 2
- Program to reverse a linked list using Stack
- Create linked list from a given array
- Print the last k nodes of the linked list in reverse order | Iterative Approaches
- Add Two Numbers Represented by Linked Lists | Set 3
- Add the given digit to a number stored in a linked list
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Linked List Implementation in C#
- Bubble Sort for Linked List by Swapping nodes
- Create new linked list from two given linked list with greater element at each node
- Iterative selection sort for linked list
- Reverse a Linked List in groups of given size (Iterative Approach)
- Find sum of even and odd nodes in a linked list
- Count duplicates in a given linked list
- Delete Nth node from the end of the given linked list
- Program to unfold a folded linked list
- Delete nodes which have a greater value on right side using recursion
- Correct the Random Pointer in Doubly Linked List
- Maximum sum of K consecutive nodes in the given Linked List
- Program to implement Run Length Encoding using Linked Lists
- Sum of nodes in a linked list which are greater than next node
- Reverse alternate K nodes in a Singly Linked List - Iterative Solution
- Sum of all distinct nodes in a linked list
- Divide the given linked list in two lists of size ratio p:q
- Insert N elements in a Linked List one after other at middle position
- Introduction to Data Structures | 10 most commonly used Data Structures
- Sum of smaller elements of nodes in a linked list
- Check whether the sum of element of a node is equal to the given key value
- Find the product of first k nodes of the given Linked List

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

Given a linked list. The task is to count the number of duplicate nodes in the linked list. Examples: Input: 5 -> 7 -> 5… Read More »

Given two linked list of the same size, the task is to create a new linked list using those linked lists. The condition is that… Read More »

Given a linked list and two integers p and q, the task is to divide the linked list in the ratio p:q i.e. the first… Read More »

Given two linked list of equal sizes, the task is to create new linked list using those linked lists where at every step, the maximum… Read More »

Given an array arr[] of size N. The task is to create linked list from the given array. Examples: Input : arr[]={1, 2, 3, 4,… Read More »

Given a linked list, the task is to find the sum of all the odd frequency nodes from the given linked list. Examples: Input: 8… Read More »

Given a linked list, every node of which consists of a pair of integer variables first and second to hold the data, and a pointer… Read More »

Given a linked list and it may consist of duplicate nodes. The task is to find the sum of non-duplicate nodes. Examples: Input: 1 ->… Read More »

Given a singly linked list, sort it using bubble sort by swapping nodes. Example: Input: 10->30->20->5 Output: 5->10->20->30 Input: 20->4->3 Output: 3->4->20 Recommended: Please try… Read More »

Given an array of N elements. The task is to insert the given elements at the middle position in the linked list one after another.… Read More »

Given a linked list, the task is to sort the linked list in ascending order by using selection sort. Examples: Input : 1->4->2->2->3 Output :… Read More »

Given an integer k and a linked list, every node of which consists of a pair of integer variable first and second to hold the… Read More »

Given a linked list, the task is to find the sum of all the nodes which are greater than the node next to them. Note… Read More »

Given a linked list, the task is to find the sum of even and odd nodes in it separately. Examples: Input: 1 -> 2 ->… Read More »