Commit 5548ff8

committed

🐱(tree): 110. 平衡二叉树

补充复杂度说明

1 parent ece29c7 commit 5548ff8Copy full SHA for 5548ff8

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -400,7 +400,7 @@ class Solution:`
`400`	`400`	`return max(left_depth, right_depth)`
`401`	`401`	```
`402`	`402`
`403`		`-- 时间复杂度:$O(nlogn)$。最差情况需要遍历树的所有节点,判断每个节点的最大高度又需要遍历该节点的所有子节点。详见[题解中的复杂度分析](https://leetcode-cn.com/problems/balanced-binary-tree/solution/ping-heng-er-cha-shu-by-leetcode/)。`
	`403`	`+- 时间复杂度:$O(nlogn)$。最差情况需要遍历树的所有节点,判断每个节点的最大高度又需要遍历该节点的所有子节点。如果树是倾斜的,则会到达 $O(n^2)$ 复杂度。详见[题解中的复杂度分析](https://leetcode-cn.com/problems/balanced-binary-tree/solution/ping-heng-er-cha-shu-by-leetcode/)。`
`404`	`404`	`- 空间复杂度:$O(n)$。如果树完全倾斜(退化成链),递归栈将包含所有节点。`
`405`	`405`
`406`	`406`	`### 解二:自底向上`

Comments

(0)