Question

Data structures c++

1- What is the search time in an AVL tree with n nodes.

Select one or more:

a. O(2^n)

b. O(height * log n)

c. O(log n)

d. O(height)

e. O(log height)

f. O(n)

g. O(1)

h. O(2^height)

Answer 1

Ans:-

(c) O(log n).

• An AVL tree is a self-balanced binary search tree. so its height is given by O(log n) where n is the number of nodes.
• searching an AVL tree is similar to searching an element in the binary search tree which makes the time proportional to the height of the tree. i.e. O(log n)

P.S. - If you find my answer useful, please take a second to give it a THUMBS UP.