## Sum of all the Boundary Nodes of a Binary Tree

Given a binary tree, the task is to print the sum of all the boundary nodes of the tree. Examples: Input: 1 / \ 2… Read More »

- Iterative Method To Print Left View of a Binary Tree
- Count the Number of Binary Search Trees present in a Binary Tree
- Zig-Zag traversal of a Binary Tree using Recursion
- Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2
- Reverse zigzag Traversal of a Binary Tree
- Reverse Level Order traversal in spiral form
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check if the given Binary Tree have a Subtree with equal no of 1's and 0's
- Iterative Postorder traversal | Set 3
- Print All Leaf Nodes of a Binary Tree from left to right | Set-2 ( Iterative Approach )
- LCA in a tree using Binary Lifting Technique
- Convert a given Binary Tree to Circular Doubly Linked List | Set 2
- Sum of all the Boundary Nodes of a Binary Tree
- Print all leaf nodes of a binary tree from right to left
- Sum of nodes in bottom view of Binary Tree
- Check if two nodes in a Binary Tree are siblings
- Print Binary Tree levels in sorted order | Set 3 (Tree given as array)
- Distribute candies in a Binary Tree
- Create a mirror tree from the given binary tree
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- K-th ancestor of a node in Binary Tree | Set 3
- Clockwise Spiral Traversal of Binary Tree | Set - 2
- Minimum sum path between two leaves of a binary tree
- Construct Binary Tree from given Parent Array representation | Iterative Approach
- Print leaf nodes in binary tree from left to right using one stack
- Print the first shortest root to leaf path in a Binary Tree
- Iterative approach to check for children sum property in a Binary Tree
- Minimum and maximum node that lies in the path connecting two nodes in a Binary Tree
- Find the kth node in vertical order traversal of a Binary Tree

Given a binary tree, the task is to print the sum of all the boundary nodes of the tree. Examples: Input: 1 / \ 2… Read More »

Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from root node. Example: 1… Read More »

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 »