Articles under the label of 平衡二叉树

平衡二叉树这个需要左右子树的深度差小于等于1，dfs解决func isBalanced(root *TreeNode) bool { _, balanced := valid(root) return balanced } func valid(root *TreeNode) (int, bool) { if root == nil { return...