feat: add typescript solution to lc problem: No.0998.Maximum Binary Tree II

Author: zhaocchen

solution/0900-0999/0998.Maximum Binary Tree II/README.md

@@ -130,6 +130,32 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * 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 insertIntoMaxTree(root: TreeNode | null, val: number): TreeNode | null {
+    if (root == null || val > root.val) {
+        return new TreeNode(val, root);
+    }
+    root.right = insertIntoMaxTree(root.right, val);
+    return root;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0900-0999/0998.Maximum Binary Tree II/README_EN.md

@@ -110,6 +110,32 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+/**
+ * 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 insertIntoMaxTree(root: TreeNode | null, val: number): TreeNode | null {
+    if (root == null || val > root.val) {
+        return new TreeNode(val, root);
+    }
+    root.right = insertIntoMaxTree(root.right, val);
+    return root;
+};
+```
+
 ### **C++**
 
 ```cpp

solution/0900-0999/0998.Maximum Binary Tree II/Solution.ts

@@ -0,0 +1,21 @@
+/**
+ * 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 insertIntoMaxTree(root: TreeNode | null, val: number): TreeNode | null {
+    if (root == null || val > root.val) {
+        return new TreeNode(val, root);
+    }
+    root.right = insertIntoMaxTree(root.right, val);
+    return root;
+};