Fixed wrong complexity

nem035 · nem035 · commit 38b8c2355e88 · 2016-06-03T23:32:50.000-04:00
diff --git a/algorithm/tree/binary_tree_traversal/desc.json b/algorithm/tree/binary_tree_traversal/desc.json
@@ -8,7 +8,7 @@
     "Post-order traversal can also generate a postfix representation of a binary tree."
   ],
   "Complexity": {
-    "time": "Best : O(N) Average : O(logN) Worst : O(N)",
+    "time": "Best : O(N) Average : O(N) Worst : O(N)",
     "space": "Worst: O(N) (recursive), Best: O(1) (iterative)"
   },
   "References": [
