https://h30306.github.io/blog/tags/bst/Recent content in Bst onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungTue, 20 Oct 2026 00:00:00 +0000https://h30306.github.io/blog/algorithm/tree/Tue, 20 Oct 2026 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/algorithm/tree/DFS return values, BFS level order, BST bounds, climbing to the LCA, tree diameter, and leaf trimminghttps://h30306.github.io/blog/leetcode/leetcode-1008/Wed, 16 Jul 2025 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-1008/LeetCode 1008 note: splitting the array is O(n^2); recursing with an upper bound is O(n)