## Interleave the first half of the queue with second half

Given a queue of integers of even length, rearrange the elements by interleaving the first half of the queue with the second half of the… Read More »

- Iterative Method To Print Left View of a Binary Tree
- Iterative Letter Combinations of a Phone Number
- Check if it is possible to reach a number by making jumps of two given length
- Difference between Stack and Queue Data Structures
- Minimum distance to the corner of a grid from source
- Sum of nodes in bottom view of Binary Tree
- Minimum steps required to reach the end of a matrix | Set 2
- Rearrange numbers in an array such that no two adjacent numbers are same
- Smallest multiple of N formed using the given set of digits
- Sort the Queue using Recursion
- Density of Binary Tree using Level Order Traversal
- LRU Approximation (Second Chance Algorithm)
- Print all the nodes except the leftmost node in every level of the given binary tree
- Iterative approach to check if a Binary Tree is Perfect
- Find the sum of leafs at maximum level
- Print the final string when minimum value strings get concatenated in every operation
- Minimum operations required to make every element greater than or equal to K
- Print even positioned nodes of even levels in level order of the given binary tree
- Reverse tree path using Queue

Given a queue of integers of even length, rearrange the elements by interleaving the first half of the queue with the second half of the… Read More »

Given a Queue consisting of first n natural numbers (in random order). The task is to check whether the given Queue elements can be arranged… Read More »

Given a binary search tree and a key, your task to reverse path of the binary tree. Prerequisite : Reverse path of Binary tree Examples… Read More »

Given an N-ary tree, find the number of siblings of given node x. Assume that x exists in the given n-ary tree. Example : Input… Read More »

Given a binary tree, print the level order traversal in such a way that first two levels are printed from left to right, next two… Read More »

Given a queue, write a recursive function to reverse it. Standard operations allowed : enqueue(x) : Add an item x to rear of queue. dequeue()… Read More »

We are given an integer N. We need to write a program to find the least positive integer X made up of only digits 9’s… Read More »

Given a queue with random elements, we need to sort it. We are not allowed to use extra space. The operations allowed on queue are… Read More »

Prerequisite : Priority Queue, Comparator Priority Queue is like a regular queue, but each element has a “priority” associated with it. In a priority queue,… Read More »

Share a queue among three threads A, B, C as per given norms : Thread A generates random integers and pushes them into a shared… Read More »

Given Nodes with their priority, implement a priority queue using doubly linked list. Prerequisite : Priority Queue Operations on Priority Queue : push(): This function… Read More »

Given a tree, print the level order traversal in sorted order. Examples : Input : 7 / \ 6 5 / \ / \ 4… Read More »

Implement Priority Queue using Linked Lists. Operations on Priority Queue : push(): This function is used to insert a new data into the queue. pop():… Read More »

Given a Binary tree, the task is to print its all level in sorted order Examples: Input : 7 / \ 6 5 / \… Read More »

A simple python List can act as queue and stack as well. Queue mechanism is used widely and for many purposes in daily life. A… Read More »