fix:复杂度更严谨

azl397985856 · web-flow · commit f25083086812 · 2021-08-04T14:37:34.000+08:00
O(n) -&gt; O(h),h for height
diff --git a/problems/236.lowest-common-ancestor-of-a-binary-tree.md b/problems/236.lowest-common-ancestor-of-a-binary-tree.md
@@ -137,8 +137,10 @@ class Solution:
 
 **复杂度分析**
 
+令 h 为树的高度。
+
 - 时间复杂度：$O(N)$
-- 空间复杂度：$O(N)$
+- 空间复杂度：$O(h)$
 
 ## 扩展
 
