Solution for Merge Two Binary Trees


  • 0
    X
    public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
            //unnecessary to consider t1 and t2 are both null, because it will return t2, which is null;
            if (t1 == null) return t2;
            if (t2 == null) return t1;
    
            TreeNode root = new TreeNode(t1.val + t2.val);
            TreeNode left = mergeTrees(t1.left, t2.left);
            TreeNode right = mergeTrees(t1.right, t2.right);
    
            root.left = left;
            root.right = right;
            return root;
        }
    

Log in to reply
 

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