| 107 | Floor and Ceil in a BST | Easy | Practice Problems | A2Z |
| 2778 | Floor in a Binary Search Tree | Easy | Practice Problems | A2Z |
| 104 | Insert a given node in BST | Medium | Practice Problems | A2Z |
| 102 | Delete a node in BST | Medium | Practice Problems | A2Z |
| 105 | Kth Smallest and Largest element in BST | Medium | Practice Problems | A2Z SDE |
| 100 | Check if a tree is a BST or not | Medium | Practice Problems | A2Z SDE B75 |
| 106 | LCA in BST | Medium | Practice Problems | A2Z SDE B75 |
| 101 | Construct a BST from a preorder traversal | Medium | Practice Problems | A2Z SDE |
| 2775 | Inorder Successor/Predecessor in BST | Medium | Practice Problems | A2Z |
| 2772 | Merge 2 BST's | Hard | Practice Problems | A2Z |
| 2774 | Two Sum In BST | Check if there exists a pair with Sum K | Hard | Practice Problems | A2Z |
| 97 | Correct BST with two nodes swapped | Hard | Practice Problems | A2Z |
| 98 | Largest BST in Binary Tree | Hard | Practice Problems | A2Z |
| 2391 | Construct BST from given keys | Easy | Practice Problems | SDE |
| 103 | Inorder successor and predecessor in BST | Medium | Practice Problems | SDE |
| 2779 | Floor in a BST | Easy | Practice Problems | SDE |
| 2777 | Ceil in a BST | Easy | Practice Problems | SDE |
| 2776 | Find K-th smallest element in BST | Medium | Practice Problems | SDE B75 |
| 99 | Two sum in BST | Hard | Practice Problems | SDE |
| 96 | BST iterator | Hard | Practice Problems | SDE |
| 2773 | Size of the largest BST in a Binary Tree | Hard | Practice Problems | SDE |