Are the below statements true about skiplists? In a sorted set of elements skip lists can implement the below operations i.given a element find closest element to the given value in the sorted set in O(logn) ii.find the number of elements in the set whose values fall a given range in O(logn)

Are the below statements true about skiplists? In a sorted set of elements skip lists can implement the below operations i.given a element find closest element to the given value in the sorted set in O(logn) ii.find the number of elements in the set whose values fall a given range in O(logn) Correct Answer true

To achieve above operations augment with few additional stuff like partial counts.
Bissoy MCQ

Related Questions

What is the time complexity improvement of skip lists from linked lists in insertion and deletion?
If the electrostatic potential were Igiven by $$\phi = {\phi _0}$$  (x2 + y2 + z2), where $${\phi _0}$$ is constant, then the charge density giving rise to the above potential would be