//二叉树第i层结点个数
int LevelNodeCount(BiTree T, int i)
{if (T == NULL || i < 1)return 0;if (i == 1) return 1;return LevelNodeCount(T->lchild, i - 1) + LevelNodeCount(T->rchild, i - 1);
}
int GetDepthOfBiTree(BiTree T)
{if (T == NULL)return 0;return GetDepthOfBiTree(T->lchild) > GetDepthOfBiTree(T->rchild) ? GetDepthOfBiTree(T->lchild) + 1: GetDepthOfBiTree(T->rchild) + 1;
}
int MaxWidth(BiTree T)
{int per = 0;int max = 0;for (int i = 1; i <= GetDepthOfBiTree(T); i++){per = LevelNodeCount(T, i);if (per > max)max = per;}return max;
}