Easy understand Java solution.


  • 0
    G
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if (t1 == null)
          return t2;
        if (t2 == null)
          return t1;
        t1.val += t2.val;
        if (t1.left == null && t2.left != null) {
          t1.left = t2.left;
          t2.left = null;
        }
        if (t1.right == null && t2.right != null) {
          t1.right = t2.right;
          t2.right = null;
        }
        mergeTrees(t1.left, t2.left);
        mergeTrees(t1.right, t2.right);
        return t1;
      }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.