Hide Index
Binary Search Tree
0% completed
Introduction to binary search trees
Height & balance in binary search trees
Recursive searching in binary search trees
Iterative searching in binary search trees
Insertion in binary search trees
Deletion in binary search trees
Constructing a binary search tree
Lowest common ansestor in binary search trees
Iterators in a binary search trees
Pattern: Sorted traversal
Pattern: Reversed sorted traversal
Pattern: Range postorder
Pattern: Two pointer
Certificate
Understanding recursive minimum search
Finding the minimum value in a binary search tree recursively is quite simple. We must traverse to the first node of the tree's inorder sequence.
Algorithm
Let us look at the recursive algorithm to quickly find the minimum value in a binary search tree. A simple recursive equation can summarise the search process we followed above.
Liking the course? Check our discounted plans to continue learning.