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

What does adt stands for?

921

Define graph?

1160

How does a dynamic array work?

930

Define articulation point?

1192

Write a program to reverse a link list.

984

Are sets sorted?

952

Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?

972

Can hashmap store null values?

952

What do you mean by union-by-weight?

1042

What is difference between hashmap and map?

1171

What are different types of sorting algorithms?

1078

How can a binary tree be represented using the rotation?

963

What is example of data?

1196

Write the disadvantages of separate chaining?

958

What things you would care about to improve the performance of application if its identified that its db communication that needs to be improved?

985