Sum The Tree

Sum The TreeCodewars

Approach

Solve the problem

the key is recursion.

1. if root not null return root.value + process-1(root.left) + process-1(root.right)

2. if root null return 0

Solution

JavaScript

const sumTheTreeValues = (root) => {
  if (root) {
    return root.value + sumTheTreeValues(root.left) + sumTheTreeValues(root.right);
  }
  
  return 0;
};