# Tag Archives: tree-level-order

## Check if max sum level of Binary tree divides tree into two equal sum halves

Given a Binary Tree, the task is to check if the maximum sum level divides the binary tree into the two parts of two equal… Read More »

## Level order traversal of Binary Tree using Morris Traversal

Given a binary tree, the task is to traverse the Binary Tree in level order fashion. Examples: Input: 1 / \ 2 3 Output: 1… Read More »

## Maximum absolute difference between any two level sum in a Binary Tree

Given a Binary Tree having positive and negative nodes, the task is to find the maximum absolute difference of level sum in it. Examples: Input:… Read More »

## Check if the Left View of the given tree is sorted or not

Given a tree, our task is to check whether its left view is sorted or not. If it is then return true else false. Examples:… Read More »

## Diamond Tree

Given a number K, the task is to create the Diamond-like structure of Tree which follows these two conditions: First K levels of the tree… Read More »

## Print all Exponential Levels of a Binary Tree

Given a Binary Tree, the task is to print all the Exponential Levels in the given Binary Tree. An Exponential Level is a level whose… Read More »

## Iterative Approach to check if two Binary Trees are Isomorphic or not

Given two Binary Trees we have to detect if the two trees are Isomorphic. Two trees are called isomorphic if one of them can be… Read More »

## Print all K-sum levels in a Binary Tree

Given a Binary Tree and an integer K where the tree has positive and negative nodes, the task is to print the elements of the… Read More »

## Boundary Level order traversal of a Binary Tree

Given a Binary Tree, the task is to print all levels of this tree in Boundary Level order traversal. Boundary Level order traversal: In this… Read More »

## Count of nodes in a Binary Tree whose immediate children are co-prime

Given a Binary Tree, the task is to count the nodes whose immediate children are co-prime. Examples: Input: 1 / \ 15 5 / \… Read More »

## Count of nodes in a Binary Tree whose child is its prime factors

Given a Binary Tree, the task is to print the count of nodes whose either of the immediate child is its prime factors. Examples: Input:… Read More »

## Count of nodes in a Binary tree with immediate children as its factors

Given a Binary Tree, the task is to print the count of nodes whose immediate children are its factors. Examples: Input: 1 / \ 15… Read More »

## Print all Co-Prime Levels of a Binary Tree

Given a Binary Tree, the task is to print all Co-prime levels of this tree. Any level of a Binary tree is said to be… Read More »

## Print all Prime Levels of a Binary Tree

Given a Binary Tree, the task is to print all prime levels of this tree. Any level of a Binary tree is said to be… Read More »

## Print all Palindromic Levels Of a Binary Tree

Given a Binary Tree, the task is to print all palindromic levels of this tree. Palindrom Level Any level of a Binary tree is said… Read More »