4.3.4.3 Binary tree search
To meet this assessment objective, you should be able to:
To meet this assessment objective, you should be able to:
Be able to trace and analyse the time complexity of the binary tree search algorithm.
Time complexity is O(log n).
3-algorithms-binary-tree-search.pptx
Binary search for number 27
Binary search for number 27
This animation compares how efficient a binary search is in comparison with the linear search of a sorted array.