Tree always takes o(log n) time because tree has height is (log n).

why do tree always takes o(log n) time?

Question Posted / manish kumar yadav

Answer Posted / manish kumar yadav

Tree always takes o(log n) time because tree has height is
(log n).

Is This Answer Correct ?

24 Yes

23 No

Please Help Members By Posting Answers For Below Questions

Can arraylist store int?

1064

How does shell sort work?

934

State the difference between persistent and ephemeral data structure?

1673

Can tuple be sorted?

938

Why is data structure important?

1012

What is the minimum number of nodes in an avl tree of height h?

886

In Data Structure, write output of given program.

918

Which is better merge or quick sort?

950

What is a map in programming?

896

What is the difference between list, set and map?

988

Describe stack operation.

976

Explain the difference between a list and array.

965

What is heap and its types?

973

What is stable sorting?

876

How is heap sort implemented?

835