diff --git a/problems/0102.二叉树的层序遍历.md b/problems/0102.二叉树的层序遍历.md
index 6cdb7414..ab6b07bf 100644
--- a/problems/0102.二叉树的层序遍历.md
+++ b/problems/0102.二叉树的层序遍历.md
@@ -129,7 +129,7 @@ class Solution {
         return resList;
     }
 
-    //DFS--递归方式
+    //BFS--递归方式
     public void checkFun01(TreeNode node, Integer deep) {
         if (node == null) return;
         deep++;