Quiz Complete, well Done!
Pre-order traversal
Space complexity
What is a binary search?
Binary search tree
What is the key condition for binary search to work correctly?
Target element
The time complexity of Binary Search is
.
Binary Search can be used to find the closest value to a target value in a
array.
Binary Search is used in many applications like
and spell checkers.
Traversing
Binary Search can be implemented both iteratively and
.
In Binary Search, search interval is repeatedly
in half.
Post-order traversal
|
|
|
|
|
|
|
|
|
|
|
|
Binary Search only works on
data.
What is the worst-case running time of linear search?
The number of iterations in Binary Search is at most
What is the purpose of a binary search?
Index
Binary Search
