codeintuition-logo
Learning PathBlogsPremiumLogin
codeintuition-logo

Hide Index

Binary Search Tree

0% completed

Introduction to binary search trees

Understanding a binary search tree
Structure of a binary search tree
Characteristics of a binary search tree
Implementation of binary search trees

Height & balance in binary search trees

Understanding the impact of height on performance
Understanding the balance of a tree
Calculate the balance factor
Calculate the balance of a subtree
Challenges in implementing complete binary search trees
Understanding height balanced binary trees
Check if tree is height balanced

Recursive searching in binary search trees

Understanding recursive search
Implement recursive search
Understanding recursive minimum search
Recursively find minimum
Understanding recursive maximum search
Recursively find maximum
Understanding recursive lower bound search
Recursively find lower bound
Understanding recursive upper bound search
Recursively find upper bound

Iterative searching in binary search trees

Understanding iterative search
Implement iterative search
Understanding iterative minimum search
Iteratively find minimum
Understanding iterative maximum search
Iteratively find maximum
Understanding iterative lower bound search
Iteratively find lower bound
Understanding iterative upper bound search
Iteratively find upper bound

Insertion in binary search trees

Understanding recursive insertion
Recursively insert a node
Understanding iterative insertion
Iteratively insert a node

Deletion in binary search trees

Inorder successor
Understanding recursive deletion
Recursively delete a node
Understanding iterative deletion
Iteratively delete a node

Constructing a binary search tree

Understanding construction from a sorted array
Construct BST from a sorted array
Understanding construction from an unsorted array
Construct BST from an unsorted array

Pattern: Inorder traversal

Lowest absolute variance
Enriched sum tree
Kth Largest element

Pattern: Validation

BST validator
Preorder sequence checker

Pattern: Two sum

Two sum on BST
BST pair sum

Pattern: Lowest common anscestor

Lowest common ancestor

Pattern: Closest value search

Closest value
K closest values

Pattern: Tree restructuring

Repair broken tree
Break up a BST
Range exclusive trim

Pattern: Conversion

BST to sorted array
Sorted linked list to BST

Pattern: Iterator design

Design a BST iterator
Design a BST iterator II

Assessments

Assessment 1
Assessment 2

Certificate

Certificate

Liking the course? Check our discounted plans to continue learning.

Subscribe now