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 maximum search
Finding the maximum value in a binary search tree recursively is similar to finding the minimum. We must traverse to the tree's first node's RNL sequence.
Algorithm
Let us look at the recursive algorithm to find the maximum value in a binary search tree quickly. A simple recursive equation can summarise the search process we followed above.
Liking the course? Check our discounted plans to continue learning.