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.
Learn Python programming
·
Module 10
Binary Search Trees
1
Properties of a Binary Search Tree
Describe the properties of a Binary Search Tree (BST)
2
BST Search and Insertion
Implement search and insertion operations in a BST
3
Deleting Nodes from a BST
Implement deletion of a node from a BST
4
Binary Tree BST Validation
Validate if a given binary tree is a BST
5
In-Order Traversal for Sorted BST Elements
Perform an in-order traversal on a BST to retrieve elements in sorted order
Previous module
Binary Trees and Traversals
Next module
Graph Traversal Algorithms