Skip to main content
grasp.study
About
Explore
Pricing
Log in
Try it for free
Back to course
👋
Welcome to a Grasp lesson
Create a free account
to keep studying and create your own study path.
Data Structures and Algorithms
·
Module 7
Binary Search Trees
1
BST Operations: Search, Insert, Delete
Implement search, insertion, and deletion operations in a Binary Search Tree (BST).
2
Validating a Binary Search Tree
Write a function to validate if a given binary tree is a valid BST.
3
Kth Smallest/Largest in BST
Find the k-th smallest or largest element in a BST.
4
Finding the Lowest Common Ancestor in a BST
Find the Lowest Common Ancestor (LCA) of two nodes in a BST.
5
Building Balanced BSTs from Sorted Arrays
Construct a height-balanced BST from a sorted array.
Previous module
Binary Trees: Traversals and Properties
Next module
Heaps and Priority Queues