# Tag Archives: tree-level-order

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
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 the BST (Binary Search Tree) from its given level order traversal. Examples:  Input: arr[] = {7, 4, 12, 3, 6, 8, 1, 5, 10}Output:… Read More
Given a generic tree, perform a Level order traversal and print all of its nodes Examples:  Input : 10 / / \ \ 2 34… Read More
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
Given a binary tree, delete a node from it by making sure that the tree shrinks from the bottom (i.e. the deleted node is replaced… Read More
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
Given a Binary Tree and a key, write a function that prints levels of all keys in given binary tree. For example, consider the following… Read More
Given an array of elements, our task is to construct a complete binary tree from this array in a level order fashion. That is, elements… Read More
Given a Binary Tree and a key, write a function that returns level of the key. For example, consider the following tree. If the input… Read More
Given two binary trees, we have to check if each of their levels is an anagram of the other or not. Example:    Tree 1: Level… Read More
Given a non-empty binary tree, print the average value of the nodes on each level. Examples:  Input : 4 / \ 2 9 / \… Read More
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
Find the level in a binary tree that has the maximum number of nodes. The root is at level 0. Examples:  Input: Output : 2… Read More
Given the level order traversal of a Complete Binary Tree, determine whether the Binary Tree is a valid Min-Heap Examples: Input : level = [10,… Read More