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

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

- Introduction to Data Structures | 10 most commonly used Data Structures
- Rearrange numbers in an array such that no two adjacent numbers are same
- Minimum steps required to reach the end of a matrix | Set 2
- Burn the binary tree starting from the target node
- Count number of ways to reach destination in a Maze using BFS
- Sort the Queue using Recursion
- Reverse tree path using Queue
- Minimum operations required to make every element greater than or equal to K
- Density of Binary Tree using Level Order Traversal
- Iterative approach to check if a Binary Tree is Perfect
- Smallest multiple of N formed using the given set of digits
- Find the maximum cost path from the bottom-left corner to the top-right corner
- LRU Approximation (Second Chance Algorithm)
- Print all the nodes except the leftmost node in every level of the given binary tree
- Reversing a Queue using another Queue
- Find the sum of leafs at maximum level
- Print the final string when minimum value strings get concatenated in every operation
- Print even positioned nodes of even levels in level order of the given binary tree
- Find the first N pure numbers
- Duplicate subtree in Binary Tree | SET 2
- Python | Queue using Doubly Linked List
- Print odd positioned nodes of even levels in level order of the given binary tree
- Print odd positioned nodes of odd levels in level order of the given binary tree
- Print even 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 even levels in the level order traversal of the tree. The… Read More »

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

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 »