Q25
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
AnswerB.
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
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board