## Insertion in n-ary tree in given order and Level order traversal

Given a set of parent nodes where the index of the array is the child of each Node value, the task is to insert the… Read More »

- Construct BST from its given level order traversal | Set-2
- Flatten Binary Tree in order of Level Order Traversal
- Density of Binary Tree using Level Order Traversal
- Maximum sum of leaf nodes among all levels of the given binary tree
- Find the sum of leafs at maximum level
- Print even positioned nodes of even levels in level order of the given binary tree
- Maximum sum of non-leaf nodes among all levels of the given binary tree
- Insertion in n-ary tree in given order and Level order traversal
- Difference between sums of odd position and even position nodes for each level of a Binary Tree

Given a set of parent nodes where the index of the array is the child of each Node value, the task is to insert the… Read More »

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 »