my easy java solution recursive


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

Log in to reply
 

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