# Tag Archives: tree-level-order

Given a binary tree, print it vertically. The following example illustrates vertical order traversal.  1 / \ 2 3 / \ / \ 4 5… Read More
Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum level in it. Examples:  Input : 4 /… Read More
Given a binary tree, print nodes of extreme corners of each level but in alternate order.Example:   For above tree, the output can be 1 2… Read More
Perfect Binary Tree using Specific Level Order Traversal in Set 1. The earlier traversal was from Top to Bottom. In this post, Bottom to Top… Read More
Given a Binary Tree, return following value for it. 1) For every level, compute sum of all leaves if there are leaves at this level. Otherwise,… Read More
Given a Perfect Binary Tree like below:  Print the level order of nodes in following specific manner:   1 2 3 4 7 5 6 8… Read More
Given a binary tree and two level numbers ‘low’ and ‘high’, print nodes from level low to level high. For example consider the binary tree… Read More
Given root of a binary tree, The task is to print level order traversal in a way that nodes of all levels are printed in… Read More
Given inorder and level-order traversals of a Binary Tree, construct the Binary Tree. Following is an example to illustrate the problem. Input: Two arrays that… Read More
Given a Binary Tree, the task is to print the Level order traversal of the Binary Tree in spiral form i.e, alternate order. Example: Input:Output:… Read More
Given the root of the Binary Tree. The task is to print the Level order traversal of a tree is breadth first traversal for the… Read More