A find operation on a balanced binary search tree is O(logn) where as a find operation for binary search tree without the balance assumption is O(n).

Question

Quizplus · Accepted Answer

A balanced binary search tree maintains a height of O(logn), ensuring that operations like find, insert, and delete take O(logn) time. However, a binary search tree without the balance guarantee can degenerate into a linked list in the worst case, making the find operation take O(n) time.

A Find Operation on a Balanced Binary Search Tree Is