We know that LinkedList class in Java is a doubly-linked list implementation of the List interface. This post provides an overview common techniques to manually implement a linked list in Java programming language.
In this post, we will discuss about XOR linked list which is used to reduce memory requirements of a doubly linked lists using bitwise XOR operator.
Given an unsorted linked list, write a function which deletes any duplicate nodes from the list by traversing the list only once.
Given an linked list of integers, rearrange it such that every second node of the linked list is greater than its left and right nodes. In other words, rearrange linked list node in alternating high-low.
In this post, we will discuss the differences between ArrayList and LinkedList in Java.
Given a linked list containing 0’s, 1’s and 2’s, sort linked list by doing single traversal of it.
This post provides an overview of some of the available techniques to implement a linked list in C++ programming language.
Write an algorithm to compute the height of a binary tree with leaf nodes forming a circular doubly linked list where the left and right pointers of the leaf node will act as a previous and next pointer of circular doubly linked list respectively. For example, consider below binary tree. The leaf nodes are …
Given a binary tree, print vertical sum of it. Assume, the left and right child of a node makes 45 degree angle with the parent.
In this post, we will see how to detect cycle in a a linked list using Hashing and Floyd’s Cycle Detection Algorithm.
Given a linked list, split it into two lists where each list contains alternating elements from the original list and then finally join them back together.
Given a linked list, move its last node to front.