The Solution for this problem is simple and recursive one. In this problem you have to traverse to the last parent node which has at least 1 child.
So the conditions possible are:
- Parent has only one leaf node a) only Left Leaf Node or b) only Right Leaf Node
- Parent has both children, Left and Right Leaf Nodes.
Now the only thing left is to traverse recursively to the last parent and check wether it has one child or 2 children and store the value of its child or sum of children into its info and if the children do not have any further children then set their value to 0.
struct BST* left;
struct BST* right;
struct BST* newNode(int);
void printTree(struct BST*);
void replaceParentWithSumOfChildren(struct BST*);