树的遍历题意：给出谱系图（多叉树)，求最多孩子的那一层的深度和宽度。 DFS遍历，记录每层的宽度，找最大的那个即可也可以用BFS做 123456789101112131415161718192021222324252627282930313

Hello This is my first post

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hex