This post is completed by 3 users

Add to List 
183. Convert binary tree to its Sum tree
Objective: Given a binary tree, write an algorithm to convert it into its Sum tree.
What is a Sum tree: A sum tree of a binary tree, is a tree where each node in the converted tree will contain the sum of the left and right subtrees in the original tree.
Example:
Approach:
 Recursively calculate the left sum from the left sum tree.
 Recursively calculate the right sum from the right tree.
 prepare the return root.data + left sum + right sum.
 Update the root data as root.data = left sum + right sum.
 update the newRoot = root.
 See the code for a better understanding.
Output:
Original Tree: 2 1 4 5 6 3 10 Sum tree: 0 2 0 8 0 4 0