99. Recover Binary Search Tree https://leetcode.com/problems/recover-binary-search-tree
669. Trim a Binary Search Tree https://leetcode.com/problems/trim-a-binary-search-tree
671. Second Minimum Node In a Binary Tree https://leetcode.com/problems/second-minimum-node-in-a-binary-tree
501. Find Mode in Binary Search Tree https://leetcode.com/problems/find-mode-in-binary-search-tree
530. Minimum Absolute Difference in BST https://leetcode.com/problems/minimum-absolute-difference-in-bst
653. Two Sum IV - Input is a BST https://leetcode.com/problems/two-sum-iv-input-is-a-bst
1008. Construct Binary Search Tree from Preorder Traversal https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal
Prerequisite Knowledge
Before reading this article, you need to first study:
The following BST problems mainly test the characteristics of BST, where left children are smaller, right children are larger, and in-order traversal is ordered.
