左子树和右子树的高度都相等

改成

左子树的高度不小于右子树

原文

binary trees of height n where for each node the left subtree is at least as high as the right subtree.

是 at least