By using the skip list concept. we can search the sorted linked list with

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

Question Posted / baskerdearer

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

Please Help Members By Posting Answers For Below Questions

What is 2 dimensional linked list?

602

What is time complexity of arrays sort?

528

Can treemap have null values?

492

Explain Linked List

573

State the different types of linked lists?

503

Is hashmap an object?

504

What are arrays used for?

544

Where is data structure used?

550

What are the types of data structures?

546

How to use appendNode() in linkedlist()?

668

What is the space complexity of quicksort?

489

Explain the Linked List

646

What are sorting algorithms used for?

535

What are basic algorithms?

459

What is difference between tree and forest?

520