18 ms AC solution

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

Log in to reply

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