Data Structures

In a BST, basic operations to search, insert, and delete run in O(h) time, where h is the height of the tree. When n = h, where n is the number of nodes, these operations are O(n) and the BST has the same runtime properties as a linked list. When the tree is balanced, the distance from the root to any leaf node at the bottom of the tree, is log(n), where n is the number of nodes in the tree. Hence the complexity to search in a balanced binary tree is ______________.

Select one:

a. None of these

b. O(n^2)

c. O(n)

d. O(2^n) e. O(log n)