[LeetCode] 559. Maximum Depth of N-ary Tree

原題鏈接：https://leetcode.com/problems/maximum-depth-of-n-ary-tree/ 1. 題目介紹 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 d

>>阅读原文<<