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

Is it possible to store null key and null values in a hashmap?

779

What are the main differences between the linked list and linear array?

923

Tell me the difference between structure and array?

909

What is a height of a tree?

832

Why do we use hashset?

872

What are the four characteristics of algorithms?

820

How do you find a string is anagram or not?

856

How does hashset work internally in java?

942

What are the major data structures used in the following areas : network data model & hierarchical data model?

983

Is bubble sort slow?

856

Is hashtable fail fast?

791

Why do we need a data structure?

934

What do you understand by doubly linked list?

862

How do you find the number of comparisons in bubble sort?

833

Is hashmap get thread safe?

826