how to search an element in sorted linked list with time
complexity is O(log n).
- 3 Answers
- 12568 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 are examples of data structures?
What is difference between capacity and size of arraylist?
Explain extended binary tree.
Differentiate between hashmap and hashtable.
What do you mean by balance factor of a node in avl tree?
State the rules to be followed during infix to postfix conversions?
How do you check if a stack is empty or not?
Which is the parent class of enumset class?
What is link list in data structure?
What is the difference between array sort () and array sort t >()?
Define binary tree insertion.
What is the advantage of the heap over a stack?
Define a priority queue?
What is data structure and data type?
What is map data structure?
