From dab64d0d6a9170d22391f1960d552ab89b56d190 Mon Sep 17 00:00:00 2001
From: ZerenZhang2022 <118794589+ZerenZhang2022@users.noreply.github.com>
Date: Mon, 5 Dec 2022 23:03:35 -0500
Subject: [PATCH] =?UTF-8?q?Update=200102.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E5=B1=82=E5=BA=8F=E9=81=8D=E5=8E=86.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

# LeetCode 429. N-ary Tree Level Order Traversal
python, 递归法
---
 problems/0102.二叉树的层序遍历.md | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)

diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 9985971f..cb5ba6bf 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -1346,6 +1346,22 @@ class Solution:
         return results
 ```
 
+```python
+# LeetCode 429. N-ary Tree Level Order Traversal
+# 递归法
+class Solution:
+    def levelOrder(self, root: 'Node') -> List[List[int]]:
+        if not root: return []
+        result=[]
+        def traversal(root,depth):
+            if len(result)==depth:result.append([])
+            result[depth].append(root.val)
+            if root.children: 
+                for i in range(len(root.children)):traversal(root.children[i],depth+1)
+            
+        traversal(root,0)
+        return result        
+```
 java:
 
 ```java