From 8397801cc7f7df3c09f1b331fe62837a07c5ce10 Mon Sep 17 00:00:00 2001
From: CyC2018 <zhengyc101@163.com>
Date: Fri, 30 Oct 2026 20:18:02 +0800
Subject: [PATCH] =?UTF-8?q?Update=2032.3=20=E6=8C=89=E4=B9=8B=E5=AD=97?=
 =?UTF-8?q?=E5=BD=A2=E9=A1=BA=E5=BA=8F=E6=89=93=E5=8D=B0=E4=BA=8C=E5=8F=89?=
 =?UTF-8?q?=E6=A0=91.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

补充利用 reverse 标记交替翻转每层结果的解题思路说明。
---
 notes/32.3 按之字形顺序打印二叉树.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/notes/32.3 按之字形顺序打印二叉树.md b/notes/32.3 按之字形顺序打印二叉树.md
index a38860db..6981278f 100644
--- a/notes/32.3 按之字形顺序打印二叉树.md	
+++ b/notes/32.3 按之字形顺序打印二叉树.md	
@@ -8,6 +8,8 @@
 
 ## 解题思路
 
+在 [32.2](32.2%20把二叉树打印成多行.md) 按层输出的基础上，用 reverse 标记当前层的方向：第 1 层从左到右，第 2 层把这一层的 list 翻转后再加入结果，之后每层交替。
+
 ```java
 public List<List<Integer>> decorateRecord(TreeNode root) {
     List<List<Integer>> ret = new ArrayList<>();