作者: imgen

int BinaryTreeHeight(node *p, int&maxHeightSum)
{
if (!p)
{
return 0;
}

int leftHeight = BinaryTreeHeight(p->left, maxHeightSum);
int rightHeight = BinaryTreeHeight(p->right, maxHeightSum);

maxHeightSum = max(leftHeight+leftHeight, maxHeightSum);
return max(leftHeight, rightHeight) + 1;
}

int findRadOfTree(node* head)
{
int maxHeightSum = 0;
BinaryTreeHeight(head, maxHeightSum);
return maxHeightSum;
}