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 do you mean by Syntax Error

1059

Describe the complexity of Binary search

892

Which is better hashmap or treemap?

959

Can we declare array size as a negative number?

985

What do u mean by data type?

872

What are the types of linked list?

894

What are the advantages and disadvantages of linked list?

860

Can treeset contain null?

878

What is binary tree and its types?

966

What is a sorting algorithm in data structure?

906

Define degree of the node?

989

What is the advantage of the heap over a stack?

997

What is ascending and descending order?

832

What is difference between list and array?

890

What is a class user?

960