1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
function mergeTrees(    root1: TreeNode | null,    root2: TreeNode | null,): TreeNode | null {    if (!root1 && !root2) return null;    if (!root1) return root2;    if (!root2) return root1;    const root = new TreeNode(root1.val + root2.val);    root.left = mergeTrees(root1.left, root2.left);    root.right = mergeTrees(root1.right, root2.right);    return root;}export default mergeTrees;