Java Recursive Solution, clear and easy understand


  • 0
    Z
        public TreeNode mergeTrees(TreeNode t1, TreeNode t2) {        
            if (t1 == null && t2 == null) {
                return null;
            }
            if (t1 == null || t2 == null) {
                return t1 == null ? t2 : t1;
            }
            TreeNode node = new TreeNode(t1.val + t2.val);
            node.left = mergeTrees(t1.left, t2.left);
            node.right = mergeTrees(t1.right, t2.right);
            return node;
        }
    

Log in to reply
 

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