how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 13223 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / baskerdearer
By using the skip list concept. we can search the sorted
linked list with O(log n).
| Is This Answer Correct ? | 35 Yes | 10 No |
Post New Answer View All Answers
What is unmodifiable list?
What is sorting an array?
Which collection type is used to maintain uniqueness of data structure?
What are the advantages of linked list over array (static data structure)?
What is the difference between data type and data structure?
What are the major data structures used in the hierarchical data model?
Write a Program for Insert in a sorted list
How would you swap the Kth node from beginning with Kth node from end in a Linked List.
How many sorting are there in data structure?
Which interfaces are implemented by abstractqueue?
Define a tree?
What are the 3 types of measurement?
What are the parts of a linked list?
What type of memory allocation is referred for Linked lists?
Why is bubble sort stable?
