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 are the different data structures?

898

What actions are performed when a function returns?

909

What is an ordered map?

905

Can nsarray contain nil?

816

How is the front of the queue calculated in data structure?

847

What are the disadvantages of linear list?

905

Tell me what should be done in the base case for this recursive problem?

870

What are the advantages of array?

891

What is the difference between data type and data structure?

860

What is complete binary tree in data structure?

952

What is the difference between hashmap and treemap?

872

Can a stack be described as a pointer? Explain.

909

What is data structure in programming language?

916

What is sort function?

870

What does simulation of queues mean?

993