The search technique known as binary search can be used to locate an element in a sorted array. This technique always looks for the element in the middle of an array.
Binary search works with sorted arrays. A binary search is used to compare a middle-of-the-array member to the desired value first. If the target value corresponds with the element, the element's location in the array is returned.
Search from the root node whenever an element has to be found. Search for the element in the left subtree if the data is smaller than the key value.
To know more about binary visit:-
https://brainly.com/question/19802955
#SPJ4
