| 95 | Unique Binary Search Trees II | — | Medium | Dynamic ProgrammingBacktrackingTree | 60% | |
| 96 | Unique Binary Search Trees | — | Medium | MathDynamic ProgrammingTree | 62% | |
| 98 | Validate Binary Search Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 34% | |
| 99 | Recover Binary Search Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 56% | |
| 108 | Convert Sorted Array to Binary Search Tree | — | Easy | ArrayDivide and ConquerTree | 74% | |
| 109 | Convert Sorted List to Binary Search Tree | — | Medium | Linked ListDivide and ConquerTree | 64% | |
| 173 | Binary Search Tree Iteratorread | — | Medium | StackTreeDesign | 75% | |
| 230 | Kth Smallest Element in a BST | — | Medium | TreeDepth-First SearchBinary Search Tree | 75% | |
| 235 | Lowest Common Ancestor of a Binary Search Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 68% | |
| 449 | Serialize and Deserialize BSTread | — | Medium | StringTreeDepth-First Search | 59% | |
| 450 | Delete Node in a BST | — | Medium | TreeBinary Search TreeBinary Tree | 53% | |
| 501 | Find Mode in Binary Search Tree | — | Easy | TreeDepth-First SearchBinary Search Tree | 57% | |
| 530 | Minimum Absolute Difference in BST | — | Easy | TreeDepth-First SearchBreadth-First Search | 59% | |
| 538 | Convert BST to Greater Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 70% | |
| 653 | Two Sum IV - Input is a BST | — | Easy | Hash TableTwo PointersTree | 62% | |
| 669 | Trim a Binary Search Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 66% | |
| 700 | Search in a Binary Search Tree | — | Easy | TreeBinary Search TreeBinary Tree | 82% | |
| 701 | Insert into a Binary Search Tree | — | Medium | TreeBinary Search TreeBinary Tree | 73% | |
| 703 | Kth Largest Element in a Stream | — | Easy | TreeDesignBinary Search Tree | 60% | |
| 783 | Minimum Distance Between BST Nodes | — | Easy | TreeDepth-First SearchBreadth-First Search | 60% | |
| 897 | Increasing Order Search Tree | — | Easy | StackTreeDepth-First Search | 79% | |
| 938 | Range Sum of BST | — | Easy | TreeDepth-First SearchBinary Search Tree | 87% | |
| 1008 | Construct Binary Search Tree from Preorder Traversal | — | Medium | ArrayStackTree | 83% | |
| 1038 | Binary Search Tree to Greater Sum Tree | — | Medium | TreeDepth-First SearchBinary Search Tree | 88% | |
| 1305 | All Elements in Two Binary Search Trees | — | Medium | TreeDepth-First SearchBinary Search Tree | 80% | |
| 1373 | Maximum Sum BST in Binary Tree | — | Hard | Dynamic ProgrammingTreeDepth-First Search | 44% | |
| 1382 | Balance a Binary Search Tree | — | Medium | Divide and ConquerGreedyTree | 85% | |
| 1569 | Number of Ways to Reorder Array to Get Same BST | — | Hard | ArrayMathDivide and Conquer | 54% | |
| 2476 | Closest Nodes Queries in a Binary Search Tree | — | Medium | ArrayBinary SearchTree | 42% | |