551 views
0 votes
0 votes

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'.$


 

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
1 answer
2