How does a Splay Tree ensure that recently accessed elements are quick to access again?

A. By performing rotations to move accessed nodes to the root

B. By balancing the tree after each operation

C. By using a self-balancing mechanism

D. By storing elements in a sorted manner

Answer: Option A