height balanced binary tree

基本解釋

Given a binary tree, determine if it is height-balanced.
給出一個(gè)二叉樹，判斷它高度是不是平衡的。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees ofeverynode never differ by more than 1.
注意平衡樹的定義，每一個(gè)點(diǎn)的左右子樹高度差不超過1，竝不是葉子結(jié)點(diǎn)的最大深度和最小深度不超過1。
For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.
對於這個(gè)問題，一個(gè)高度平衡的二叉樹是指每個(gè)節(jié)點(diǎn)的兩個(gè)子節(jié)點(diǎn)的深度的差異都不超過1的二叉樹。