Exercise: Binary Search Tree I labuladong Original About 11580 words
99. 恢复二叉搜索树 https://leetcode.cn/problems/recover-binary-search-tree 99. Recover Binary Search Tree https://leetcode.com/problems/recover-binary-search-tree 285. 二叉搜索树中的中序后继 https://leetcode.cn/problems/inorder-successor-in-bst 285. Inorder Successor in BST https://leetcode.com/problems/inorder-successor-in-bst 510. 二叉搜索树中的中序后继 II https://leetcode.cn/problems/inorder-successor-in-bst-ii 510. Inorder Successor in BST II https://leetcode.com/problems/inorder-successor-in-bst-ii 669. 修剪二叉搜索树 https://leetcode.cn/problems/trim-a-binary-search-tree 669. Trim a Binary Search Tree https://leetcode.com/problems/trim-a-binary-search-tree 671. 二叉树中第二小的节点 https://leetcode.cn/problems/second-minimum-node-in-a-binary-tree 671. Second Minimum Node In a Binary Tree https://leetcode.com/problems/second-minimum-node-in-a-binary-tree 501. 二叉搜索树中的众数 https://leetcode.cn/problems/find-mode-in-binary-search-tree 501. Find Mode in Binary Search Tree https://leetcode.com/problems/find-mode-in-binary-search-tree 530. 二叉搜索树的最小绝对差 https://leetcode.cn/problems/minimum-absolute-difference-in-bst 530. Minimum Absolute Difference in BST https://leetcode.com/problems/minimum-absolute-difference-in-bst 653. 两数之和 IV - 输入 BST https://leetcode.cn/problems/two-sum-iv-input-is-a-bst 653. Two Sum IV - Input is a BST https://leetcode.com/problems/two-sum-iv-input-is-a-bst 776. 拆分二叉搜索树 https://leetcode.cn/problems/split-bst 776. Split BST https://leetcode.com/problems/split-bst 814. 二叉树剪枝 https://leetcode.cn/problems/binary-tree-pruning 814. Binary Tree Pruning https://leetcode.com/problems/binary-tree-pruning 1008. 前序遍历构造二叉搜索树 https://leetcode.cn/problems/construct-binary-search-tree-from-preorder-traversal 1008. Construct Binary Search Tree from Preorder Traversal https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal 1214. 查找两棵二叉搜索树之和 https://leetcode.cn/problems/two-sum-bsts 1214. Two Sum BSTs https://leetcode.com/problems/two-sum-bsts Prerequisite Knowledge
Before reading this article, you need to first learn:
The following BST problems mainly test the characteristics of BSTs where the left child is smaller, the right child is larger, and in-order traversal is sorted.
Prev
Exercise: Binary Tree Level II
Next
Exercise: Binary Search Tree II