Update 02.Binary-Tree-Traverse.md

Author: itcharge

Contents/07.Tree/01.Binary-Tree/02.Binary-Tree-Traverse.md

@@ -273,7 +273,7 @@ class Solution:
 
 如下图所示，该二叉树的后序遍历顺序为：$A - B - C - D - E - F - G - H - I - J - K$。
 
-![二叉树的层序遍历](https://qcdn.itcharge.cn/images/20240511171712.png)
+![二叉树的层序遍历](https://qcdn.itcharge.cn/images/20240511175431.png)
 
 二叉树的层序遍历是通过队列来实现的。具体步骤如下：