# Tag Archives: tree-level-order

## Level order traversal with direction change after every two levels

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 »

## Smallest value in each level of Binary Tree

Given a binary tree containing n nodes, the task is to print minimum element in each level of binary tree. Examples: Input : 7 /… Read More »

## Level order traversal line by line | Set 3 (Using One Queue)

Given a Binary Tree, print the nodes level wise, each level on a new line. Output: 1 2 3 4 5 Recommended: Please solve it… Read More »

## Construct a tree from Inorder and Level order traversals | Set 2

Given inorder and level-order traversals of a Binary Tree, construct the Binary Tree. Following is an example to illustrate the problem. Examples: Input: Two arrays… Read More »

## Print Binary Tree levels in sorted order | Set 2 (Using set)

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

## Print Binary Tree levels in sorted order

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

## Largest value in each level of Binary Tree | Set-2 (Iterative Approach)

Given a binary tree containing n nodes. The problem is to find and print the largest value present in each level. Examples: Input : 1… Read More »

## Largest value in each level of Binary Tree

Given a binary tree, find the largest value in each level. Examples : Input : 1 / \ 2 3 Output : 1 3 Input… Read More »

## Sum of leaf nodes at minimum level

Given a binary tree containing n nodes. The problem is to get the sum of all the leaf nodes which are at minimum level in… Read More »

## Check if the given array can represent Level Order Traversal of Binary Search Tree

Given an array of size n. The problem is to check whether the given array can represent the level order traversal of a Binary Search… Read More »

## Construct BST from its given level order traversal

Construct the BST (Binary Search Tree) from its given level order traversal. Examples: Input : arr[] = {7, 4, 12, 3, 6, 8, 1, 5,… Read More »

## General Tree (Each node can have arbitrary number of children) Level Order Traversal

Given a generic tree, perform a Level order traversal and print all of its nodes Examples: Input : 10 / / \ \ 2 34… Read More »

## Print the nodes at odd levels of a tree

Given a binary tree, print nodes of odd level in any order. Root is considered at level 1. For example consider the following tree 1… Read More »

## Deletion in a Binary Tree

Given a binary tree, delete a node from it by making sure that tree shrinks from the bottom (i.e. the deleted node is replaced by… Read More »

## Connect Nodes at same Level (Level Order Traversal)

Write a function to connect all the adjacent nodes at the same level in a binary tree. Example: Input Tree A / \ B C… Read More »