From aa76f4c922c3aba6d895d6e7eab46fd786dd4c4d Mon Sep 17 00:00:00 2001 From: CyC2018 Date: Fri, 23 Oct 2026 04:39:44 +0800 Subject: [PATCH] =?UTF-8?q?Update=2054.=20=E4=BA=8C=E5=8F=89=E6=9F=A5?= =?UTF-8?q?=E6=89=BE=E6=A0=91=E7=9A=84=E7=AC=AC=20K=20=E4=B8=AA=E7=BB=93?= =?UTF-8?q?=E7=82=B9.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Co-Authored-By: Claude Fable 5 --- notes/54. 二叉查找树的第 K 个结点.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/notes/54. 二叉查找树的第 K 个结点.md b/notes/54. 二叉查找树的第 K 个结点.md index 7f932fe9..0ace6217 100644 --- a/notes/54. 二叉查找树的第 K 个结点.md +++ b/notes/54. 二叉查找树的第 K 个结点.md @@ -1,6 +1,10 @@ # 54. 二叉查找树的第 K 个结点 -[NowCoder](https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github) +[NowCoder](https://www.nowcoder.com/practice/57aa0bab91884a10b5136ca2c087f8ff?tpId=13&tqId=2305268&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking&from=cyc_github) + +## 题目描述 + +给定一棵二叉查找树，找出其中第 k 小的结点。 ## 解题思路