diff --git a/codes/go/chapter_tree/binary_tree_bfs.go b/codes/go/chapter_tree/binary_tree_bfs.go
index 4ace9fcfe..76dc4aea4 100644
--- a/codes/go/chapter_tree/binary_tree_bfs.go
+++ b/codes/go/chapter_tree/binary_tree_bfs.go
@@ -18,7 +18,7 @@ func levelOrder(root *TreeNode) []int {
 	// 初始化一个切片，用于保存遍历序列
 	nums := make([]int, 0)
 	for queue.Len() > 0 {
-		// 队首元素出队
+		// 队列出队
 		node := queue.Remove(queue.Front()).(*TreeNode)
 		// 保存结点值
 		nums = append(nums, node.Val)