## Print odd positioned nodes of odd levels in level order of the given binary tree

Given a binary tree, the task is to print the odd positioned nodes of odd levels in the level order traversal of the tree. The… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Priority Queue of Vectors in C++ STL with Examples
- Queue of Pairs in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Level order traversal in spiral form | Using Deque
- Priority queue of pairs in C++ with ordering by first and second element
- Real-time application of Data Structures
- Implementing Water Supply Problem using Breadth First Search
- What is a Webcrawler and where is it used?
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- Design a Queue data structure to get minimum or maximum in O(1) time
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Longest subarray whose elements can be made equal by maximum K increments
- Print all Exponential Levels of a Binary Tree
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Append the elements of queue in mirror-inverse order
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Static and Dynamic data structures in Java with Examples
- Maximum absolute difference between any two level sum in a Binary Tree
- Clockwise Triangular traversal of a Binary Tree
- Find integral points with minimum distance from given set of integers using BFS
- Nth positive number whose absolute difference of adjacent digits is at most 1
- Minimum difference between maximum and minimum value of Array with given Operations
- Print Nth Stepping or Autobiographical number
- Minimum possible modifications in the matrix to reach destination
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Minimum number of operations required to set all elements of a binary matrix

Given a binary tree, the task is to print the odd positioned nodes of odd levels in the level order traversal of the tree. The… Read More »

Given a queue. The task is to reverse the queue using another another empty queue. Examples: Input: queue[] = {1, 2, 3, 4, 5} Output:… Read More »

Given a binary tree, the task is to check whether the binary tree contains a duplicate sub-tree of size two or more. Input: A /… Read More »

Given an integer N, the task is to print first Nth pure numbers. A number is said to be pure if It has even number… Read More »

Given a maze with obstacles, count number of paths to reach rightmost-bottom most cell from the topmost-leftmost cell. A cell in the given maze has… Read More »

Given a two dimensional grid, each cell of which contains integer cost which represents a cost to traverse through that cell. The task is to… Read More »

A Queue is a collection of objects that are inserted and removed using First in First out Principle(FIFO). Insertion is done at the back(Rear) of… Read More »

Given a binary tree and target node. By giving the fire to the target node and fire starts to spread in a complete tree. The… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. The idea is to reduce… Read More »

Given a tree and a node, the task is to reverse the path till the given Node and print the in-order traversal of the modified… Read More »

Given a queue and the task is to sort it using recursion without using any loop. We can only use the following functions of queue:… Read More »

Given an array of length N. The task is to convert it into a sequence in which all elements are greater than or equal to… Read More »

Given an array of integers. The task is to rearrange elements of the array such that no two adjacent elements in the array are same.… Read More »

Given a Binary Tree, find the density of it by doing one traversal of it. The density of binary tree is defined as: Density of… Read More »

Given a binary tree, the task is to print all the nodes except the leftmost in every level of the tree. The root is considered… Read More »