Given a n-ary tree, find its maximum depth.
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.T
阅读背景：
(N叉树 DFS 递归 BFS) leetcode 559. Maximum Depth of N-ary Tree
来源：互联网
分享到：
