Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from root node.
1 / \ 2 3 / \ / \ 4 5 6 7 Input : root(of above tree) Output : 22 Explanation: Nodes at maximum depth are: 4, 5, 6, 7. So, sum of these nodes = 22
In the previous article we discussed a recursive solution which first finds the maximum level and then finds the sum of all nodes present at that level.
In this article we will see a recursive solution without finding the height or depth. The idea is that while traversing the nodes compare the level of the node with max_level (Maximum level till the current node). If the current level exceeds the maximum level, update the max_level as current level. If the max level and current level are same, add the root data to current sum otherwise if level is less than max_level, do nothing.
Below is the implementation of the above approach:
- Sum of nodes at maximum depth of a Binary Tree
- Sum of nodes at maximum depth of a Binary Tree | Iterative Approach
- Maximum sum of nodes in Binary tree such that no two are adjacent
- Find maximum among all right nodes in Binary Tree
- Replace node with depth in a binary tree
- Find Minimum Depth of a Binary Tree
- Calculate depth of a full Binary tree from Preorder
- Depth of the deepest odd level node in Binary Tree
- Write a Program to Find the Maximum Depth or Height of a Tree
- Sum of all nodes in a binary tree
- Sum of all leaf nodes of binary tree
- Sum of all the Boundary Nodes of a Binary Tree
- Sink Odd nodes in Binary Tree
- XOR of path between any two nodes in a Binary Tree
- Product of all nodes in a Binary Tree