Easiest C++ recursive Soln


#1
TreeNode* Solution::solve(TreeNode* A, TreeNode* B) 
{
    if(!B)
        return A;
    if(!A)
        return B;
    A->val+=B->val;
    A->left = solve(A->left, B->left);
    A->right = solve(A->right, B->right);
    return A;
}