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.
Understand and apply algorithms
·
Module 9
Trees and Binary Search Trees
1
Understanding Tree Terminology
Define key tree terminology: root, parent, child, leaf, height, and depth.
2
Properties of a BST
Explain the properties of a Binary Search Tree (BST).
3
Searching in a BST
Implement a search operation in a BST.
4
Inserting Nodes into a BST
Implement an insertion operation in a BST.
5
BST Traversal Algorithms
Implement in-order, pre-order, and post-order traversals of a BST.
6
BST Time Complexity: Balanced vs. Unbalanced
Analyze the time complexity of BST operations in balanced vs. unbalanced cases.
7
BST Practice: Finding the Minimum Value
Solve a practice problem involving a BST, such as finding the minimum value.
Previous module
Hash Tables
Next module
Graph Algorithms