2018年10月29日
[LeetCode] 559. Maximum Depth of N-ary Tree N叉树的最大深度
摘要： 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 le 阅读全文
posted @ 2018-10-29 21:41 Grandyang 阅读(3507) 评论(3) 推荐(0) 编辑
Fork me on GitHub