2022-08-10

[gongpeione]

617 Merge Two Binary Trees

/*
 * @lc app=leetcode id=617 lang=typescript
 *
 * [617] Merge Two Binary Trees
 */

// @lc code=start
/**
 * Definition for a binary tree node.
 * class TreeNode {
 *     val: number
 *     left: TreeNode | null
 *     right: TreeNode | null
 *     constructor(val?: number, left?: TreeNode | null, right?: TreeNode | null) {
 *         this.val = (val===undefined ? 0 : val)
 *         this.left = (left===undefined ? null : left)
 *         this.right = (right===undefined ? null : right)
 *     }
 * }
 */

function mergeTrees(root1: TreeNode | null, root2: TreeNode | null): TreeNode | null {
    if (!root1 && !root2) {
        return null;
    }
    const newRoot = new TreeNode(
        (root1?.val || 0) + (root2?.val || 0),
        mergeTrees(root1?.left, root2?.left),
        mergeTrees(root1?.right, root2?.right)
    );

    return newRoot;
};
// @lc code=end

---

Nickname: Geeku From vscode-hzfe-algorithms