4.3.4.2 Binary search

 To meet this assessment criteria, you should be able to:

Know and be able to trace and analyse the time complexity of the binary search algorithm. Time complexity is O(log n).

BST for number 27