Binary Search Trees | DSA Patterns

1. Basics

• Search an element

• Ceil of an element

• Floor of an element

• Insert an element

• Delete an element

---

2. Medium

• Find K-th smallest/largest element in BST

• Check if a tree is a BST or BT

• LCA in Binary Search Tree

• Construct a BST from a preorder traversal

• Inorder Successor/Predecessor in BST

• BST's Iterator

• Two Sum In BST

• Largest BST in Binary Tree

• Recover a BST where Two Nodes are Swapped

• Convert Sorted List to Balanced BST

• Find Minimum and Maximum in a BST

---