From b802b8add8fa367d09494c37fe20c13e123b14a3 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=E8=81=AA=E5=A8=81?= Date: Sun, 16 Sep 2018 14:17:21 +0800 Subject: [PATCH] =?UTF-8?q?Update=20=E5=89=91=E6=8C=87=20offer=20=E9=A2=98?= =?UTF-8?q?=E8=A7=A3.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- notes/剑指 offer 题解.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/notes/剑指 offer 题解.md b/notes/剑指 offer 题解.md index 4af993dd..e1a87b5b 100644 --- a/notes/剑指 offer 题解.md +++ b/notes/剑指 offer 题解.md @@ -1559,7 +1559,7 @@ public ArrayList> Print(TreeNode pRoot) { 输入一个整数数组，判断该数组是不是某二叉搜索树的后序遍历的结果。假设输入的数组的任意两个数字都互不相同。 -例如，下图是后序遍历序列 3,1,2 所对应的二叉搜索树。 +例如，下图是后序遍历序列 1,3,2 所对应的二叉搜索树。