int MaxDistanceOfTree(TreeNodeEx *pRoot)
{
	if (pRoot == NULL)
	{
		return 0;
	}
	stack<TreeNodeEx*> nodeStack;
	TreeNodeEx *pNode = pRoot;
	int nMaxDist = 0;
	while (pNode != NULL || !nodeStack.empty())
	{
		if (pNode != NULL)
		{
			nodeStack.push(pNode);
			pNode = pNode->pLeft;
		} 
		else
		{
			pNode = nodeStack.top();
			nodeStack.pop();
			if (!pNode->visited)
			{
				pNode->visited = true;
				nodeStack.push(pNode);
				pNode = pNode->pRight;
			} 
			else
			{
				pNode->nLeft = (pNode->pLeft == NULL) ? 0 : max(pNode->pLeft->nLeft, pNode->pLeft->nRight) + 1;
				pNode->nRight = (pNode->pRight == NULL) ? 0 : max(pNode->pRight->nLeft, pNode->pRight->nRight) + 1;
				if (pNode->nLeft + pNode->nRight > nMaxDist)
				{
					nMaxDist = pNode->nLeft + pNode->nRight;
				}
				pNode = NULL;
			}
		}
	}

	return nMaxDist;
}