Update 34. 二叉树的层序遍历.md

jasoncao11 · jasoncao11 · commit ba727edd31ac · 2022-07-29T15:01:41.000+08:00
diff --git a/34. 二叉树的层序遍历.md b/34. 二叉树的层序遍历.md
@@ -2,6 +2,11 @@
 
 ![algo16](./images/algo16.jpg)
 
+```
+输入：root = [3,9,20,null,null,15,7]
+输出：[[3],[9,20],[15,7]]
+```
+
 ```
 class Solution:
     def levelOrder(self, root: Optional[TreeNode]) -> List[List[int]]:
