https://leetcode.cn/problems/KnLfVT/

Author: masx200

KnLfVT/index.ts

@@ -0,0 +1,15 @@
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
+export default function expandBinaryTree(
+    root: TreeNode | null,
+): TreeNode | null {
+    return root
+        ? new TreeNode(
+            root.val,
+            root.left ? new TreeNode(-1, expandBinaryTree(root.left)) : null,
+            root.right
+                ? new TreeNode(-1, null, expandBinaryTree(root.right))
+                : null,
+        )
+        : null;
+}

README.md

@@ -45,6 +45,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/KnLfVT/
+
 https://leetcode.cn/problems/letter-case-permutation/
 
 https://leetcode.cn/problems/count-items-matching-a-rule/