https://leetcode.cn/problems/reverse-odd-levels-of-binary-tree/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/reverse-odd-levels-of-binary-tree/
+
 https://leetcode.cn/problems/smallest-even-multiple/
 
 https://leetcode.cn/problems/design-underground-system/

reverse-odd-levels-of-binary-tree/index.ts

@@ -0,0 +1,28 @@
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
+function reverseOddLevels(root: TreeNode | null): TreeNode | null {
+    if (!root) return null;
+    let depth = 0;
+    level([root], (nodes) => {
+        if (depth & 1) {
+            nodes.map((a) => a.val).reverse().forEach((v, i) =>
+                nodes[i].val = v
+            );
+        }
+        depth++;
+    });
+    return root;
+}
+export default reverseOddLevels;
+export function level(nodes: TreeNode[], output: (r: TreeNode[]) => void) {
+    if (nodes.length === 0) return;
+
+    output(nodes);
+
+    level(
+        nodes
+            .map((n) => [n.left, n.right].filter(Boolean) as TreeNode[])
+            .flat(),
+        output,
+    );
+}