Given a n-ary tree, find its maximum depth.node
The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.spa
For example, given a 3-ary
tree:code
We should return its max depth, which is 3.blog
/* // 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 == NULL) { return 0; } int maxd = 1; int tmp = 1; for (auto child : root->children) { tmp = 1 + maxDepth(child); if (tmp > maxd) { maxd = tmp; } } return maxd; } // int maxDepth(Node* root) { // if (root == nullptr) return 0; // int depth = 0; // for (auto child : root->children) depth = max(depth, maxDepth(child)); // return 1 + depth; // } };