Learning Path
Blogs
Premium
Login
Send
Hide Index
Binary Search Tree
0% completed
Introduction
What is a binary search tree?
Structure of a binary search tree
Characteristics of a binary search tree
Implementation
Recursive searching
Recursive search
Recursively find minimum
Recursively find maximum
Recursively find lower bound
Recursively find upper bound
Iterative searching
Iterative search
Iteratively find minimum
Iteratively find maximum
Iteratively find lower bound
Iteratively find upper bound
Insertion
Recursive insertion
Iterative insertion
Deletion
Inorder successor
Recursive deletion
Iterative deletion
Construction
Sorted array to BST
Unsorted array to BST
Height & balance
Height of a binary search tree
Balance of a tree
Complete binary search tree
Height balanced binary tree
Balance Factor
Balance of subtree
Height balanced tree
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? Start a
FREE
trial to continue learning.
Start free trial