Binary search tree..:)

Which one is faster?
A binary search of an orderd set of elements in an array
or
a sequential search of the elements.

Question Posted / priyank

Answer Posted / priyank

Is This Answer Correct ?

0 Yes

1 No

Please Help Members By Posting Answers For Below Questions

Which time complexity is best?

880

How many types of data structure are there?

873

What is difference between arraylist and list?

910

Does treemap allow null key?

850

Why do we use insertion sort?

844

What is the best case for bubble sort?

853

Why is hashmap faster?

908

What are the topics in data structures?

999

How will you free the memory that is allocated at run time?

960

Why is quicksort unstable?

937

What is Another name of Dynamically allocating memory.

972

What is the time complexity of selection sort?

834

Does treeset allow null values?

875

Which type of memory allocation is referred for linked list?

1184

Define balanced trees?

989