Onlearn
DSA
Data Science
Projects
Get started
Start with DSA Fundamentals
Programming Fundamentals
Start
Back to modules
Module 14 · 0/16
Module 14
Binary Search Trees
0/16
5
8
3
Concepts and Basic Operations
0/5
1
Introduction to BST
Easy
2
Search in BST
Easy
3
Find Minimum and Maximum Elements
Med.
4
Insert Node in BST
Easy
5
Delete Node in BST
Med.
Properties and Validation
0/5
1
Ceil in BST
Easy
2
Floor in BST
Easy
3
Find K-th Smallest and Largest Element
Med.
4
Validate Binary Search Tree
Med.
5
Lowest Common Ancestor in BST
Med.
Construction and Iterator Patterns
0/3
1
Construct BST from Preorder Traversal
Med.
2
Inorder Successor and Predecessor
Med.
3
Two Sum in BST
Med.
Advanced Problems
0/3
1
Recover BST
Hard
2
Largest BST in Binary Tree
Hard
3
Merge Two BSTs
Hard