617. 合并二叉树

最新推荐文章于 2022-04-14 10:33:50 发布

wxn19940927

最新推荐文章于 2022-04-14 10:33:50 发布

阅读量144

点赞数

本文链接：https://blog.csdn.net/wxn19940927/article/details/85231653

版权

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

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
class Solution {
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        if(t1==null&&t2==null)
        {
            return null;
        }
        TreeNode root=new TreeNode(0);
        if(t1!=null&&t2==null)
        {
            root=t1;
        }
        else if(t2!=null&&t1==null)
        {
            root=t2;
        }
        else if(t1!=null&&t2!=null)
        {
            root.val=t1.val+t2.val;
            if(t1.left==null&&t2.left!=null)
            {
                t1.left=new TreeNode(0);
                root.left=mergeTrees(t1.left,t2.left);
            }
            if(t2.left==null&&t1.left!=null)
            {
                t2.left=new TreeNode(0);
                root.left=mergeTrees(t1.left,t2.left);
            }
            if(t1.left!=null&&t2.left!=null)
            {
                root.left=mergeTrees(t1.left,t2.left);
            }
            if(t1.right==null&&t2.right!=null)
            {
                t1.right=new TreeNode(0);
                root.right=mergeTrees(t1.right,t2.right);
            }
            if(t2.right==null&&t1.right!=null)
            {
                t2.right=new TreeNode(0);
                root.right=mergeTrees(t1.right,t2.right);
            }
            if(t1.right!=null&&t2.right!=null)
            {
                root.right=mergeTrees(t1.right,t2.right);
            }
        }
        return root;
    }
}