---
title: "559. Maximum Depth of N-ary Tree"
url: "https://laigary.com/interview/coding/559-maximum-depth-of-n-ary-tree"
type: "note"
section: "coding"
date: "2023-01-29"
updated: "2023-01-29"
tags: ["Tree"]
---

# 559. Maximum Depth of N-ary Tree

[559\. Maximum Depth of N-ary Tree](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)

```python
"""
# Definition for a Node.
class Node:
    def __init__(self, val=None, children=None):
        self.val = val
        self.children = children
"""

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])

```