It is known that the depth of the complete binary tree is (log2w). In worst case, the number of
comparisons in each step would be equal to the depth of the tree. The number of comparisons for
the above observation would be O (nlog2n). Thus, the number of comparisons in this method
would be O (n log2 n).
SUMMARY
1) Searching is a technique of finding accurate location of an element in the given item list or set
of the elements of an array, list, or trees.
2) If the given element is present in the collected elements or array then the search process is said
to be successful. The search is said to be ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.