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 construction from an unsorted array
Constructing a binary search tree from an unsorted array of values is easy. It is not always the best method, but it is one of the easiest.
Algorithm
To construct a binary search tree from a given sequence, we start with an empty binary tree and insert all the elements in the sequence into it individually.
Liking the course? Check our discounted plans to continue learning.