## Construct BST from its given level order traversal | Set-2

Construct the BST (Binary Search Tree) from its given level order traversal. Examples: Input : {7, 4, 12, 3, 6, 8, 1, 5, 10} Output… Read More »

- Level order traversal of Binary Tree using Morris Traversal
- Sum of all nodes at Kth level in a Binary Tree
- Boundary Level order traversal of a Binary Tree
- Specific Level Order Traversal of Binary Tree
- Diamond Tree
- Deletion of a given node K in a Binary Tree using Level Order Traversal
- Print all Exponential Levels of a Binary Tree
- Maximum absolute difference between any two level sum in a Binary Tree
- Construct a Binary in Level Order using Recursion
- Check if max sum level of Binary tree divides tree into two equal sum halves
- Print all K-sum levels in a Binary Tree
- Iterative Approach to check if two Binary Trees are Isomorphic or not
- Print all Palindromic Levels Of a Binary Tree
- Print all Co-Prime Levels of a Binary Tree
- Count of nodes in a Binary Tree whose child is its prime factors
- Check if the Left View of the given tree is sorted or not
- Count of nodes in a Binary Tree whose immediate children are co-prime
- Print all nodes except rightmost node of every level of the Binary Tree
- Count of nodes in a Binary tree with immediate children as its factors
- Print all Prime Levels of a Binary Tree
- Replace every node with depth in N-ary Generic Tree
- Largest number possible by arranging node values at each level

Construct the BST (Binary Search Tree) from its given level order traversal. Examples: Input : {7, 4, 12, 3, 6, 8, 1, 5, 10} Output… Read More »

Given a Binary Tree, the task is to flatten it in order of Level order traversal of the tree. In the flattened binary tree, the… Read More »

Given a Binary Tree, find the density of it by doing one traversal of it. The density of binary tree is defined as: Density of… Read More »

Given a Binary Tree, the task is to find the absolute difference between the sums of odd and even positioned nodes. A node is said… Read More »

Given a binary tree, print even positioned nodes of even level in level order traversal. The root is considered at level 0, and the left… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum of non-leaf nodes among all level of given… Read More »

Given a Binary Tree having positive and negative nodes, the task is to find the maximum sum of leaf nodes among all level of the… Read More »

Given a binary tree containing n nodes. The task is to find the sum of all the leaf nodes present at maximum level. Examples: Input:… Read More »

Given a binary tree, the task is to print the nodes of the tree in an anti-clockwise spiral manner. Examples: Input: 1 / \ 2… Read More »

Given a binary tree, the task is to print the reverse level order in spiral form. Examples: Input: 1 / \ 2 3 / \… Read More »

Given a Binary Tree with distinct values, the task is to print the first smallest root to leaf path. We basically need to print the… Read More »

Given a Binary tree, the task is to print all the internal nodes in a tree. An internal node is a node which carries at… Read More »

Given a Binary Tree, the task is to print the Reverse zigzag Order of the tree. Examples: Input: 1 / \ 2 3 / \… Read More »

Given a Binary Tree, print it’s left view. Left view of a Binary Tree is a set of nodes visible when tree is seen from… Read More »

Given a binary tree and an integer b representing budget. The task is to find the count of maximum number of leaf nodes that can… Read More »