Binary-Search-Tree onhttps://h30306.github.io/blog/zh-tw/tags/binary-search-tree/Recent content in Binary-Search-Tree onHugo -- gohugo.iozh-twhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungSun, 25 Oct 2026 00:00:00 +0000LeetCode 449: Serialize and Deserialize BSThttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-449/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-449/LeetCode 449 解題筆記：BST 只要存前序，不用空節點標記；反序列化帶著上下界遞迴，O(n)LeetCode 450: Delete Node in a BSThttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-450/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-450/LeetCode 450 解題筆記：找到節點後分三種情況：沒有小孩、一個小孩直接接上，兩個小孩用右子樹最小值替換再刪掉它LeetCode 99: Recover Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-99/Sun, 25 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-99/LeetCode 99 解題筆記：中序遍歷找逆序：第一次逆序的前一個、最後一次逆序的後一個，就是被交換的兩個節點LeetCode 173: Binary Search Tree Iteratorhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-173/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-173/LeetCode 173 解題筆記：攤平成陣列很直接但用 O(n) 空間；follow-up 用 stack 存左側鏈，均攤 O(1)、空間 O(h)LeetCode 701: Insert into a Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-701/Sat, 24 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-701/LeetCode 701 解題筆記：沿著 BST 往下走到空位接上新節點；空樹要直接回傳新節點LeetCode 1373: Maximum Sum BST in Binary Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-1373/Thu, 10 Sep 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-1373/LeetCode 1373 解題筆記：後序遍歷回傳 (總和, 最小值, 最大值, 是不是 BST)；左子樹的最大值 < 自己 < 右子樹的最小值才是 BSTLeetCode 109: Convert Sorted List to Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-109/Sat, 19 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-109/LeetCode 109 解題筆記：快慢指針找中點當根，左右兩半遞迴建樹；高度自然平衡LeetCode 230: Kth Smallest Element in a BSThttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-230/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-230/LeetCode 230 解題筆記：BST 的中序遍歷是由小到大，迭代中序走到第 k 個就停LeetCode 98: Validate Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-98/Sat, 29 Oct 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-98/LeetCode 98 解題筆記：每個節點都有一個合法範圍（下界, 上界），往左走上界變成自己、往右走下界變成自己；只比父子不夠LeetCode 938: Range Sum of BSThttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-938/Mon, 26 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-938/LeetCode 938 解題筆記：利用 BST 剪枝，節點比 low 小就只往右，比 high 大就只往左，在範圍內才加LeetCode 897: Increasing Order Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-897/Sun, 25 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-897/LeetCode 897 解題筆記：中序遍歷，依序把節點接到一條只有右小孩的鏈上，左小孩設成 None；dummy 和移動的尾巴要分開LeetCode 783: Minimum Distance Between BST Nodeshttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-783/Tue, 06 Sep 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-783/LeetCode 783 解題筆記：BST 的中序是由小到大，最小差一定出現在中序相鄰的兩個值之間；記住前一個值逐一比較LeetCode 700: Search in a Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-700/Wed, 31 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-700/LeetCode 700 解題筆記：比目標大就往左、比目標小就往右，找到就回傳那個節點LeetCode 703: Kth Largest Element in a Streamhttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-703/Wed, 31 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-703/LeetCode 703 解題筆記：維持一個大小為 k 的最小堆，堆頂就是第 k 大LeetCode 501: Find Mode in Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-501/Thu, 25 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-501/LeetCode 501 解題筆記：BST 中序是排序的，相同的值會連在一起；中序時數目前這段的長度，比最大值大就重設答案，一樣大就加入LeetCode 530: Minimum Absolute Difference in BSThttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-530/Thu, 25 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-530/LeetCode 530 解題筆記：BST 的中序是由小到大，最小差一定出現在中序相鄰的兩個值之間；記住前一個值逐一比較LeetCode 235: Lowest Common Ancestor of a Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-235/Mon, 22 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-235/LeetCode 235 解題筆記：p、q 都比節點小就往左，都比節點大就往右，否則（一邊一個或其中一個就是自己）這個節點就是 LCALeetCode 108: Convert Sorted Array to Binary Search Treehttps://h30306.github.io/blog/zh-tw/leetcode/leetcode-108/Tue, 16 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/zh-tw/leetcode/leetcode-108/LeetCode 108 解題筆記：中間的元素當根，左右兩半遞迴；左右大小最多差 1，自然是平衡的