## Find product of sums of data of leaves at same levels | Set 2

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Iterative Postorder traversal | Set 3
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- K-th ancestor of a node in Binary Tree | Set 3
- Calculate height of Binary Tree using Inorder and Level Order Traversal
- Flatten Binary Tree in order of Level Order Traversal
- Find the largest Complete Subtree in a given Binary Tree
- Count all k-sum paths in a Binary Tree
- Find the kth node in vertical order traversal of a Binary Tree
- Check if the given n-ary tree is a binary tree
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
- Find the largest Perfect Subtree in a given Binary Tree
- Get last node of the binary tree following given pattern starting from X
- Sum of the mirror image nodes of a complete binary tree in an inorder way
- Print all the nodes except the leftmost node in every level of the given binary tree
- Maximum sum of leaf nodes among all levels of the given binary tree
- Find the sum of leafs at maximum level
- Sum of nodes in the left view of the given binary tree
- Print even positioned nodes of even levels in level order of the given binary tree
- Flatten binary tree in order of post-order traversal
- Convert ternary expression to Binary Tree using Stack
- Connect all nodes to their Left Neighbors in a Binary Tree
- Find the node whose xor with x gives minimum value
- Queries to find the maximum Xor value between X and the nodes of a given level of a perfect binary tree
- Find the color of given node in an infinite binary tree
- Duplicate subtree in Binary Tree | SET 2
- Maximum sum of non-leaf nodes among all levels of the given binary tree
- Maximum length cycle that can be formed by joining two nodes of a binary tree
- Maximum XOR with given value in the path from root to given node in the tree
- Find Maximum Level Sum in Binary Tree using Recursion

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

Given a complete binary tree, traverse it such that all the boundary nodes are visited in Anti-Clockwise order starting from the root. Example: Input: 18… Read More »

Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree. For the above binary tree,… Read More »

Given a Binary tree and number of nodes in the tree, the task is to find the number of pairs violating the BST property. Binary… Read More »

Given a Binary Tree. The task is to find the maximum value among all of the right child nodes of the Binary Tree. Note: If… Read More »

Merkle tree also known as hash tree is a data structure used for data verification and synchronization. It is a tree data structure where each… Read More »

Given a Binary Tree, the task is to find the Coefficient of Range in it. Range is defined as the difference between the maximum and… Read More »

Given a binary tree and a node in the binary tree, find Levelorder successor of the given node. That is, the node that appears after… Read More »

Given a binary tree and a node in the binary tree, find Levelorder Predecessor of the given node. That is, the node that appears before… Read More »

Given a binary tree. First print all leaf nodes, after that remove all the leaf nodes from the tree and now print all the new… Read More »

Given a binary tree and two nodes of that binary tree. Find the sum of all nodes with odd values in the path connecting the… Read More »

Given a Binary Tree of distinct nodes and a pair of nodes. The task is to find and print the path between the two given… Read More »

Given a Binary Tree with distinct nodes. Given two nodes node1 and node2, check if the two nodes lies in the same subtree of the… Read More »

Given a binary tree with distinct nodes and a pair of two nodes. The task is to find the XOR of all of the nodes… Read More »

Given a Binary Node and a node. The task is to search and check if the given node exits in the binary tree or not.… Read More »