Quiz Complete, well Done!
What is the first step of binary search?
Time complexity
Binary Search can be implemented both iteratively and
.
How would you calculate the middle index of a list in binary search?
What is the purpose of a binary search?
Mid-point
Binary Search can be used to find the closest value to a target value in a
array.
What is the key difference between binary search and linear search?
What is the best-case running time of binary search?
What is the key condition for binary search to work correctly?
Comparison
Leaf
Binary Search is an example of a
algorithm.
Binary Search only works on
data.
Balanced binary search tree
What is the worst-case running time of linear search?
What is Binary Search?
|
|
|
|
|
|
|
|
|
|
|
|
Target element
Post-order traversal
