老江和小胡表情对比 (转载)# Joke - 肚皮舞运动
q*x
1 楼
这个递归解法简洁但低效。应该用DP，在hash table里把每个节点和子树深度记下来？
int getHeight(Node* root)
{
if (root === NULL) return 0;
return max(getHeight(root->left), getHeight(root->right)) + 1;
}
bool isAVL(Node* root)
{
if (root == NULL) return true;
return abs(getHeight(root->left) - getHeight(root->right)) <= 1
&& isAVL(root->left) && is AVL(root->right);
}
int getHeight(Node* root)
{
if (root === NULL) return 0;
return max(getHeight(root->left), getHeight(root->right)) + 1;
}
bool isAVL(Node* root)
{
if (root == NULL) return true;
return abs(getHeight(root->left) - getHeight(root->right)) <= 1
&& isAVL(root->left) && is AVL(root->right);
}