BST Problems
About 1 min
Binary Search Tree Problems
| # | Title | Solution | Tags | Difficulty |
|---|---|---|---|---|
| 0098 | Validate Binary Search Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium |
| 0173 | Binary Search Tree Iterator | [[LeetCode XXXX]] | Stack, Tree, Design, Binary Search Tree, Binary Tree, Iterator | Medium |
| 0700 | Search in a Binary Search Tree | [[LeetCode XXXX]] | Tree, Binary Search Tree, Binary Tree | Easy |
| 0701 | Insert into a Binary Search Tree | [[LeetCode XXXX]] | Tree, Binary Search Tree, Binary Tree | Medium |
| 0450 | Delete Node in a BST | [[LeetCode XXXX]] | Tree, Binary Search Tree, Binary Tree | Medium |
| 0703 | Kth Largest Element in a Stream | [[LeetCode XXXX]] | Tree, Design, Binary Search Tree, Binary Tree, Stream, Heap (Priority Queue) | Easy |
| 0230 | Kth Smallest Element in a BST | Tree, Depth-First Search, Binary Search Tree, Binary Tree | Medium | |
| 0235 | Lowest Common Ancestor of a Binary Search Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Binary Search Tree, Binary Tree | Easy |
| 0426 | Convert Binary Search Tree to Sorted Doubly Linked List | [[LeetCode XXXX]] | Stack, Tree, Depth-First Search, Binary Search Tree, Linked List, Binary Tree, Doubly Linked List | Medium |
| 0108 | Convert Sorted Array to Binary Search Tree | [[LeetCode XXXX]] | Tree, Binary Search Tree, Array, Divide and Conquer, Binary Tree | Easy |
| 0110 | Balanced Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Binary Tree | Easy |