Breadth First Search Algorithm to Convert Level Order Binary Search Tree to Linked List
Given a binary search tree root, convert it to a singly linked list using level order traversal. Constraints 1 ≤ n ≤ 100,000 where n is the number of …
Tag: linked list
Algorithms to Convert Binary Linked List to Integer
Given a single linked list node, representing a binary number with most significant digits first, return it as an integer. Example 1 Input node = 1 → 0 → …
How to Delete N Nodes After M Nodes of a Linked List?
Given the head of a linked list and two integers m and n. Traverse the linked list and remove some nodes in the following way: Start with the head …
How to Remove Zero Sum Consecutive Nodes from Linked List using Prefix Sum?
Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences. After doing so, return the …
How to Convert Binary Number in a Linked List to Integer?
Given head which is a reference node to a singly-linked list. The value of each node in the linked list is either 0 or 1. The linked list holds …