递归计算二叉树的高度

//calculate height of binary tree if given the head node


int Height_of_bTree(Node *node)
{
	if (!node)
	{
		return 0;
	}

	if (node->left && node->right)
	{
		return max(Height_of_bTree(node->left)+1,Height_of_bTree(node->right)+1);
	}

	if (node->left)
	{
		return Height_of_bTree(node->left)+1;
	}

	if (node->right)
	{
		return Height_of_bTree(node->right)+1;
	}
	
	return 0;	//in case the tree contains only head node
}