| Convert Sorted Array to Binary Search Tree | Easy | 75.2% |
| Binary Search Tree Iterator | Medium | 76.2% |
| Kth Largest Element in a Stream | Easy | 60.7% |
| Trim a Binary Search Tree | Medium | 66.6% |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% |
| Lowest Common Ancestor of a Binary Search Tree | Medium | 70.1% |
| Validate Binary Search Tree | Medium | 35.4% |
| Recover Binary Search Tree | Medium | 58.8% |
| Construct Binary Search Tree from Preorder Traversal | Medium | 84.1% |
| Insert into a Binary Search Tree | Medium | 73.4% |
| Balance a Binary Search Tree | Medium | 86.3% |
| Two Sum IV - Input is a BST | Easy | 63.0% |
| Serialize and Deserialize BST | Medium | 59.4% |
| Unique Binary Search Trees | Medium | 63.3% |
| Minimum Absolute Difference in BST | Easy | 59.2% |
| Delete Node in a BST | Medium | 54.2% |
| Range Sum of BST | Easy | 87.6% |
| Merge BSTs to Create Single BST | Hard | 38.0% |
| Kth Smallest Element in a BST | Medium | 76.5% |
| Maximum Sum BST in Binary Tree | Hard | 46.5% |
| Unique Binary Search Trees II | Medium | 62.0% |
| Search in a Binary Search Tree | Easy | 82.5% |
| Binary Search Tree to Greater Sum Tree | Medium | 88.4% |
| Convert BST to Greater Tree | Medium | 71.4% |
| Increasing Order Search Tree | Easy | 78.9% |
| All Elements in Two Binary Search Trees | Medium | 80.2% |
| Two Sum BSTs | Medium | 68.2% |
| Minimum Distance Between BST Nodes | Easy | 61.1% |
| Closest Binary Search Tree Value II | Hard | 61.1% |
| Split BST | Medium | 82.2% |
| Convert Binary Search Tree to Sorted Doubly Linked List | Medium | 65.6% |
| Inorder Successor in BST | Medium | 51.1% |
| Find Mode in Binary Search Tree | Easy | 58.5% |
| Inorder Successor in BST II | Medium | 61.1% |
| Closest Binary Search Tree Value | Easy | 49.3% |
| Number of Ways to Reorder Array to Get Same BST | Hard | 54.0% |
| Verify Preorder Sequence in Binary Search Tree | Medium | 51.7% |
| Closest Nodes Queries in a Binary Search Tree | Medium | 44.1% |