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

What is a class user?

954

How do you declare An array of three char pointers

993

Mention the data structures which are used in graph implementation.

864

How to sort 1 million floating point numbers?

1162

Can we store null in arraylist?

904

Define 2-3-4 tree?

869

What is the need for path compression?

1064

Should I use hashmap or hashtable?

865

What is the basic of data structure?

987

Which is the parent class of printerstatereasons class?

870

Define leaves?

1020

Why is arraylist used?

930

How to reverse a singly linked list?

1002

How to find the duplicate in an array?

933

How do you do binary search?

866