Binary Search Tree

Binary Search Tree Concepts

• Basics – Search | Insert | Delete |
• Insertion And Deletion In A Bst | Augmented Bst

Checking and Searching

• Validate Binary Search Tree * | Inorder Successor in BST |
• Inorder Successor in BST II | Two Sum IV – Input is a BST |
• Find min and max element in a BST
• Ancestor/Descendent:
  • Lowest Common Ancestor of a Binary Search Tree *
  • Test If Three BST Nodes Are Totally Ordered

Construction and Conversion –

• Binary Search Tree Iterator | Convert Sorted Array to Binary Search Tree
• Convert Sorted List to Binary Search Tree |
• Construct Binary Search Tree from Preorder Traversal  |
• Build A Minimum Height Bst From A Sorted Array |
• Binary Search Tree to Greater Sum Tree |
• Recover Binary Search Tree | Trim a Binary Search Tree

Closest Value –

• Closest Binary Search Tree Value | Closest Binary Search Tree Value II |
• Find The Closest Entries In Three Sorted Arrays

Kth Largest/Smallest in BST

• Kth Highest in BST | Kth Smallest in BST * | Kth Largest Element in a Stream

Balanced BSTs:

• Design A Leaderboard | Contains Duplicate II | Contains Duplicate III

TreeMap:

• Time Based Key-Value Store

Misc

• Shortest distance between two nodes in BST |
• Serialize and Deserialize BST | Minimal Tree | BST Sequences |
• Find The First Key Greater Than A Given Value In A Bst |
• The Most Visited Pages Problem | The Range Lookup Problem
• Add Credits