https://leetcode.cn/problems/binary-tree-pruning/ https://leetcode.cn/problems/pOCWxh/

Author: masx200

README.md

@@ -10,6 +10,10 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/binary-tree-pruning/
+
+https://leetcode.cn/problems/pOCWxh/
+
 https://leetcode.cn/problems/word-ladder/
 
 https://leetcode.cn/problems/add-one-row-to-tree/

binary-tree-pruning/index.ts

@@ -0,0 +1,10 @@
+import { TreeNode } from "../mod.ts";
+
+export default function pruneTree(root: TreeNode | null): TreeNode | null {
+    if (!root) return null;
+    const left = pruneTree(root.left);
+    const right = pruneTree(root.right);
+    if (root.val === 0 && !left && !right) return null;
+
+    return new TreeNode(root.val, left, right);
+}

binary-tree-pruning/test.ts

@@ -0,0 +1,66 @@
+import { assertEquals } from "https://deno.land/[email protected]/testing/asserts.ts";
+import pruneTree from "./index.ts";
+
+Deno.test("binary-tree-pruning", () => {
+    const inputs = [
+        {
+            val: 1,
+            left: {
+                val: 0,
+                left: { val: 0, left: null, right: null },
+                right: { val: 0, left: null, right: null },
+            },
+            right: {
+                val: 1,
+                left: { val: 0, left: null, right: null },
+                right: { val: 1, left: null, right: null },
+            },
+        },
+        {
+            val: 1,
+            left: {
+                val: 1,
+                left: {
+                    val: 1,
+                    left: { val: 0, left: null, right: null },
+                    right: null,
+                },
+                right: { val: 1, left: null, right: null },
+            },
+            right: {
+                val: 0,
+                left: { val: 0, left: null, right: null },
+                right: { val: 1, left: null, right: null },
+            },
+        },
+    ];
+    const outputs = [
+        {
+            val: 1,
+            left: null,
+            right: {
+                val: 1,
+                left: null,
+                right: { val: 1, left: null, right: null },
+            },
+        },
+        {
+            val: 1,
+            left: {
+                val: 1,
+                left: { val: 1, left: null, right: null },
+                right: { val: 1, left: null, right: null },
+            },
+            right: {
+                val: 0,
+                left: null,
+                right: { val: 1, left: null, right: null },
+            },
+        },
+    ];
+
+    assertEquals(
+        structuredClone(inputs.map((input) => pruneTree(input))),
+        outputs,
+    );
+});

pOCWxh/index.ts

@@ -0,0 +1 @@
+export { default } from "../binary-tree-pruning/index.ts";

serialize-and-deserialize-n-ary-tree/index.ts

@@ -73,42 +73,3 @@ function ArrayToNAryNode(array: (number[] | null)[][]): Node | null {
     }
     return root;
 }
-// Deno.test("NAryNodeToArray", () => {
-//     const root = new Node(1, [
-//         new Node(3, [new Node(5), new Node(6)]),
-//         new Node(2),
-//         new Node(4, [
-//             new Node(13, [
-//                 new Node(15),
-//                 new Node(16, [
-//                     new Node(43, [
-//                         new Node(25),
-//                         new Node(26, [
-//                             new Node(14, [
-//                                 new Node(23, [
-//                                     new Node(45),
-//                                     new Node(46, [
-//                                         new Node(33, [
-//                                             new Node(35),
-//                                             new Node(36),
-//                                         ]),
-//                                     ]),
-//                                 ]),
-//                             ]),
-//                         ]),
-//                     ]),
-//                 ]),
-//             ]),
-//         ]),
-//     ]);
-//     console.log(JSON.stringify(root, null, 4), NAryNodeToArray(root));
-//     console.log(null, NAryNodeToArray(null));
-//     const root2 = new Node(10);
-//     console.log(root2, NAryNodeToArray(root2));
-//     const root3 = new Node(10, [new Node(20, [new Node(200)]), new Node(21)]);
-//     console.log(JSON.stringify(root3, null, 4), NAryNodeToArray(root3));
-// });
-// Deno.test("ArrayToNAryNode", () => {
-//     const array = [[[10]], [[20, 21, 19]], [null, [200]]];
-//     console.log(array, JSON.stringify(ArrayToNAryNode(array), null, 4));
-// });