{"id":3122,"date":"2018-07-14T07:31:30","date_gmt":"2018-07-14T14:31:30","guid":{"rendered":"http:\/\/zxi.mytechroad.com\/blog\/?p=3122"},"modified":"2018-07-14T07:38:17","modified_gmt":"2018-07-14T14:38:17","slug":"leetcode-559-maximum-depth-of-n-ary-tree","status":"publish","type":"post","link":"https:\/\/zxi.mytechroad.com\/blog\/tree\/leetcode-559-maximum-depth-of-n-ary-tree\/","title":{"rendered":"\u82b1\u82b1\u9171 LeetCode 559. Maximum Depth of N-ary Tree"},"content":{"rendered":"

Problem<\/h1>\n

Given a n-ary tree, find its maximum depth.<\/p>\n

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.<\/p>\n

For example, given a\u00a03-ary<\/code>\u00a0tree:<\/p>\n

 <\/p>\n

<\/p>\n

 <\/p>\n

We should return its max depth, which is 3.<\/p>\n

Note:<\/b><\/p>\n

    \n
  1. The depth of the tree is at most\u00a01000<\/code>.<\/li>\n
  2. The total number of nodes is at most\u00a05000<\/code>.<\/li>\n<\/ol>\n

    Solution: Recursion<\/strong><\/h1>\n

    Time complexity: O(n)<\/p>\n

    Space complexity: O(n)<\/p>\n

    \/\/ Author: Huahua\r\n\/\/ Running time: 40 ms\r\nclass Solution {\r\npublic:\r\n  int maxDepth(Node* root) {\r\n    if (root == nullptr) return 0;\r\n    int depth = 0;\r\n    for (auto child : root->children)\r\n      depth = max(depth, maxDepth(child));\r\n    return depth + 1;\r\n  }\r\n};<\/pre>\n
    Related Problems<\/strong><\/h1>\n