559. Maximum Depth of N-ary Tree LeetCode Solution

In this guide, you will get 559. Maximum Depth of N-ary Tree LeetCode Solution with the best time and space complexity. The solution to Maximum Depth of N-ary Tree problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Problem Statement
Complexity Analysis
Maximum Depth of N-ary Tree solution in C++
Maximum Depth of N-ary Tree solution in Java
Maximum Depth of N-ary Tree solution in Python
Additional Resources

559. Maximum Depth of N-ary Tree LeetCode Solution image

Problem Statement of Maximum Depth of N-ary Tree

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.
Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).

Example 1:

Input: root = [1,null,3,2,4,null,5,6]
Output: 3

Example 2:

Input: root = [1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]
Output: 5

Constraints:

The total number of nodes is in the range [0, 104].
The depth of the n-ary tree is less than or equal to 1000.

Complexity Analysis

Time Complexity: O(n)
Space Complexity: O(h)

559. Maximum Depth of N-ary Tree LeetCode Solution in C++

class Solution {
 public:
  int maxDepth(Node* root) {
    if (root == nullptr)
      return 0;

    int ans = 0;

    for (Node* child : root->children)
      ans = max(ans, maxDepth(child));

    return 1 + ans;
  }
};
/* code provided by PROGIEZ */

559. Maximum Depth of N-ary Tree LeetCode Solution in Java

class Solution {
  public int maxDepth(Node root) {
    if (root == null)
      return 0;

    int ans = 0;

    for (Node child : root.children)
      ans = Math.max(ans, maxDepth(child));

    return 1 + ans;
  }
}
// code provided by PROGIEZ

559. Maximum Depth of N-ary Tree LeetCode Solution in Python

class Solution:
  def maxDepth(self, root: 'Node') -> int:
    if not root:
      return 0
    if not root.children:
      return 1
    return 1 + max(self.maxDepth(child) for child in root.children)
 # code by PROGIEZ