Skip to content
THE CS NOTES

Data Structure - BST ▶️

L39. Introduction to Binary Search Tree | BST ✅

Section titled “L39. Introduction to Binary Search Tree | BST ✅”

L40. Search in a Binary Search Tree | BST | C++ | Java ✅

Section titled “L40. Search in a Binary Search Tree | BST | C++ | Java ✅”

L41. Ceil in a Binary Search Tree | BST | C++ | Java

Section titled “L41. Ceil in a Binary Search Tree | BST | C++ | Java”

L42. Floor in a Binary Search Tree | BST | C++ | Java

Section titled “L42. Floor in a Binary Search Tree | BST | C++ | Java”

L43. Insert a given Node in Binary Search Tree | BST | C++ | Java ✅

Section titled “L43. Insert a given Node in Binary Search Tree | BST | C++ | Java ✅”

L44. Delete a Node in Binary Search Tree | BST | C++ | Java ⭐

Section titled “L44. Delete a Node in Binary Search Tree | BST | C++ | Java ⭐”

L45. K-th Smallest/Largest Element in BST ⭐

Section titled “L45. K-th Smallest/Largest Element in BST ⭐”

L46. Check if a tree is a BST or BT | Validate a BST ⭐

Section titled “L46. Check if a tree is a BST or BT | Validate a BST ⭐”

L47. LCA in Binary Search Tree

Section titled “L47. LCA in Binary Search Tree”

L48. Construct a BST from a preorder traversal | 3 Methods ⭐

Section titled “L48. Construct a BST from a preorder traversal | 3 Methods ⭐”

L49. Inorder Successor/Predecessor in BST | 3 Methods ⭐

Section titled “L49. Inorder Successor/Predecessor in BST | 3 Methods ⭐”

L50. Binary Search Tree Iterator | BST | O(H) Space ⭐

Section titled “L50. Binary Search Tree Iterator | BST | O(H) Space ⭐”

L51. Two Sum In BST | Check if there exists a pair with Sum K

Section titled “L51. Two Sum In BST | Check if there exists a pair with Sum K”

L52. Recover BST | Correct BST with two nodes swapped ⭐

Section titled “L52. Recover BST | Correct BST with two nodes swapped ⭐”

L53. Largest BST in Binary Tree

Section titled “L53. Largest BST in Binary Tree”