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

How to sort 1 million floating point numbers?

1262

What is meant by deque?

976

What are the average and worst time complexity in a sorted binary tree is

1014

Is array a collection?

974

What is the top of a stack?

1043

Write the algorithm for converting infix expression to postfix expression?

1023

What is definition list?

992

Does concat mutate array?

971

Define structure property in a heap?

1039

What are the types of map?

987

What is a tech stack?

929

Is array immutable?

971

What is meant by ordered and sorted in collections?

955

Explain exception filter?

1019

Define level of the tree?

1028