[LeetCode] 559. Maximum Depth of N-ary Tree(C++)

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. For example, given a 3-ary tree:     We s

>>阅读原文<<