https://leetcode.cn/problems/count-complete-tree-nodes/

Author: masx200

README.md

@@ -10,6 +10,8 @@ leetcode 测试
 
 ##### 包含的内容如下
 
+https://leetcode.cn/problems/count-complete-tree-nodes/
+
 https://leetcode.cn/problems/broken-calculator
 
 https://leetcode.cn/problems/pairs-with-sum-lcci/

count-complete-tree-nodes/index.ts

@@ -0,0 +1,21 @@
+import { TreeNode } from "../binary-tree-inorder-traversal/TreeNode.ts";
+
+export default function countNodes(root: TreeNode | null): number {
+    if (root === null) return 0;
+    let left = 0,
+        right = 0;
+    let curNode: TreeNode | null = root;
+    while (curNode !== null) {
+        left++;
+        curNode = curNode.left;
+    }
+    curNode = root;
+    while (curNode !== null) {
+        right++;
+        curNode = curNode.right;
+    }
+    if (left === right) {
+        return 2 ** left - 1;
+    }
+    return 1 + countNodes(root.left) + countNodes(root.right);
+}