559

Author: ProHiryu

DFS/traditionalDFS/559.md

@@ -0,0 +1,34 @@
+## 559 Maximum Depth of N-ary Tree
+
+#### Description
+
+[link](https://leetcode.com/problems/maximum-depth-of-n-ary-tree/)
+
+---
+
+#### Solution
+
+- See Code
+
+---
+
+#### Code
+
+> 最坏情况：O(n^2)
+
+```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 max(self.maxDepth(x) for x in root.children) + 1
+```