What is the primary advantage of using a Skip List over a Binary Search Tree?

A. To maintain strict ordering of elements

B. To support efficient priority queue operations

C. To provide probabilistic balancing and efficient insertions

D. To handle large datasets with constant time access

Answer: Option C