Interested to Buy Any Domain ? << Click Here >> for more details...
how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 13891 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
Where is data structure used?
How do I push an element into a stack?
How do you find the length of an arraylist?
Which interfaces are implemented by hashmap?
Explain linked list in short.
What is merge sort and how it works?
What are the drawbacks of array implementation of queue?
State the properties of a binary tree?
What is binary tree in discrete mathematics?
what is the primary advantage of a linked list?
What is arraylist load factor?
What are binary trees?
What are the types of map?
Name few concurrent collection classes?
What is difference between data type and variable?
