| 230 | Kth Smallest Element in a BST | Medium |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Easy |
| 449 | Serialize and Deserialize BST | Medium |
| 450 | Delete Node in a BST | Medium |
| 501 | Find Mode in Binary Search Tree | Easy |
| 530 | Minimum Absolute Difference in BST | Easy |
| 538 | Convert BST to Greater Tree | Medium |
| 653 | Two Sum IV - Input is a BST | Easy |
| 700 | Search in a Binary Search Tree | Easy |
| 701 | Insert into a Binary Search Tree | Medium |
| 703 | Kth Largest Element in a Stream | Easy |
| 783 | Minimum Distance Between BST Nodes | Easy |
| 897 | Increasing Order Search Tree | Easy |
| 938 | Range Sum of BST | Easy |
| 1008 | Construct Binary Search Tree from Preorder Traversal | Medium |
| 1038 | Binary Search Tree to Greater Sum Tree | Medium |
| 1305 | All Elements in Two Binary Search Trees | Medium |
| 1373 | Maximum Sum BST in Binary Tree | Hard |
| 1382 | Balance a Binary Search Tree | Medium |
| 1569 | Number of Ways to Reorder Array to Get Same BST | Hard |