mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 03:34:02 +08:00
Correct typo in 0102.二叉树的层序遍历.md
This commit is contained in:
@ -129,7 +129,7 @@ class Solution {
|
|||||||
return resList;
|
return resList;
|
||||||
}
|
}
|
||||||
|
|
||||||
//DFS--递归方式
|
//BFS--递归方式
|
||||||
public void checkFun01(TreeNode node, Integer deep) {
|
public void checkFun01(TreeNode node, Integer deep) {
|
||||||
if (node == null) return;
|
if (node == null) return;
|
||||||
deep++;
|
deep++;
|
||||||
|
Reference in New Issue
Block a user