## Find multiplication of sums of data of leaves at same levels

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.… Read More »

## Perfect Binary Tree Specific Level Order Traversal

Given a Perfect Binary Tree like below: (click on image to get a clear view) Print the level order of nodes in following specific manner:… Read More »

## Print nodes between two given level numbers of a binary tree

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 »

## Print level order traversal line by line | Set 1

Given a binary tree, print level order traversal in a way that nodes of all levels are printed in separate lines. For example consider the… Read More »

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

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 »

## Level order traversal in spiral form

Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7. Recommended:… Read More »

## Level Order Tree Traversal

Level order traversal of a tree is breadth first traversal for the tree. Level order traversal of the above tree is 1 2 3 4… Read More »