Binary Search Tree

Question

Consider a binary search tree for the following sequence of nodes $a,b,g,f,c,e,d$
What is the resultant tree if splaying is done at $'d'.$

 

Comments

How it can be B as B is not balanced. Btw I used basic rotation scheme for solving this considering we need to bring d to the root.

---

Yes $C$ is the right answer

---

Soumya Tiwari

But splay trees are not height balanced.

https://www.quora.com/How-do-splay-trees-balance-themselves