Yes u are right ... here are the details http://msdn.microsoft.com/en-

how to search an element in sorted linked list with time
complexity is O(log n).

Question Posted / sniper

Answer Posted / sniper

Yes u are right ...
here are the details

http://msdn.microsoft.com/en-us/library/ms379573%28v=vs.80%29.aspx#datastructures20_4_topic4

thanks ...

Is This Answer Correct ?

3 Yes

1 No

Please Help Members By Posting Answers For Below Questions

What do you mean by 2-3 tree?

679

Can you provide some implementation of a dictionary having large number of words?

892

Differentiate between hashset and treeset.

727

Is heap sort stable?

659

Does arraylist contain duplicates?

647

Differentiate bfs and dfs?

765

How to show internal storage representation of data structure in RDBM?

732

What is the height of a binary tree?

680

Can we increase the size of statically allocated array?

653

do records fall under linear or non linear data structures?

1482

What is difference between for loop and foreach?

650

Define the tree data structure.

677

Is linkedlist thread safe?

633

Does treeset allow duplicates?

638

Does hashset maintain order?

668