建立树的孩子兄弟链表存储结构，求树的深度。
要求：
1）自上而下输入树中每条边（例如#A,AB,AC,BD,##），不要转换成二叉树输入。
2）按树中由根至叶子结点层次遍历顺序（每层中自左至右输入），输入结点序列及每个结点的度，构造孩子兄弟链表。(Establish the storage structure of the tree's child and brother list, and find the depth of the tree.
Requirement:
1) Input each edge in the tree from top to bottom (for example, a, AB, AC, BD, b). Do not convert it to binary tree input.
2) According to the traversal order from root to leaf node in the tree (input from left to right in each layer), input the node sequence and the degree of each node, and construct the child brother list.)