fd

Author: dingjikerbo

leetcode/solution/src/CountCompleteTreeNodes.java

@@ -26,7 +26,7 @@ public int countNodes(TreeNode root) {
         return count;
     }*/
 
-    // 119ms，最差复杂度是O(n),最好是O(lgn)
+    // 119ms，最差复杂度是O((lgn)^2),最好是O(lgn)
     public int countNodes(TreeNode root) {
         int left = 0, right = 0;
         for (TreeNode node = root; node != null; node = node.left, left++);