Skip to content

Tag Archives: tree-level-order

Given a binary tree, flatten it into linked list in-place. Usage of auxiliary data structure is not allowed. After flattening, left of each node should… Read More
Given a binary tree and the two nodes say ‘a’ and ‘b’, determine whether two given nodes are cousins of each other or not. Two… Read More
Given a binary tree. The task is to check if the binary tree is sorted level-wise or not. A binary tree is level sorted if… Read More
Given a Binary Tree having positive and negative nodes, the task is to find maximum product level in it. Examples: Input : 4 / \… 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 binary tree containing n nodes, the task is to print the minimum elements in each level of the binary tree.Examples:  Input : 7… 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
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 that… Read More
Given a tree, print the level order traversal in sorted order. Examples : Input : 7 / \ 6 5 / \ / \ 4… Read More
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
Given a binary tree, find the largest value in each level. Examples : Input : 1 / \ 2 3 Output : 1 3 Input… Read More
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,… Read More