559. Maximum Depth of N-ary Tree

559. Maximum Depth of N-ary Tree

---

题目

Leetcode题目

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 should return its max depth, which is 3.

Note:

1. The depth of the tree is at most 1000.
2. The total number of nodes is at most 5000.

---

解决

设一共有n个节点。

1.深度优先
利用递归深度优先遍历树，求每一个节点到根节点的距离，取最大值为树的深度。

• 时间复杂度：O(n)
• 空间复杂度：O(1)

/**
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
public:
    int maxDepth(Node* root) {
        if (!root) return 0;
        int childDepth = 0;
        for (auto node : root->children) {
            childDepth = max(childDepth, maxDepth(node));
        }
        return childDepth + 1;
    }
};

2.广度优先
广度优先遍历树，遍历时记录当前节点的深度，并与之前的最大深度进行比较。最终得到的最大深度为树的深度。

• 时间复杂度：O(n)
• 空间复杂度：O(n)

/**
// Definition for a Node.
class Node {
public:
    int val;
    vector<Node*> children;

    Node() {}

    Node(int _val, vector<Node*> _children) {
        val = _val;
        children = _children;
    }
};
*/
class Solution {
public:
    int maxDepth(Node* root) {
        queue<pair<Node*, int> > tree;
        int depth = 0;
        if (!root) return depth;
        tree.push(make_pair(root, 1));
        while (!tree.empty()) {
            pair<Node*, int> temp = tree.front();
            depth = max(depth, temp.second);
            int n = temp.first->children.size();
            for (int i = 0; i < n; i++) {
                tree.push(make_pair(temp.first->children[i], temp.second + 1));
            }
            tree.pop();
        }
        return depth;
    }
};