Math, asked by harinarayana01012000, 1 month ago

Question 11. The number of steps taken for searching the value x in a binary tree with n nodes ... a) depends on x. b) depends on n. c) is O(log2 n). d) is O(log, n).​

Answers

Answered by jafarjanisha2020
2

Answer:

(a)

Step-by-step explanation:

the the average time required to search on element in a brainery search tree having elements

the answer is first one

Similar questions