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'.$ DS data-structures binary-search-tree + – Lakshman Bhaiya asked Oct 27, 2018 Lakshman Bhaiya 599 views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Lakshman Bhaiya commented Oct 27, 2018 reply Follow Share I do not understand what is the meaning of "if splaying is done at ′d′."?? 0 votes 0 votes Balaji Jegan commented Oct 27, 2018 reply Follow Share Splay Tree is not in syllabus 0 votes 0 votes Lakshman Bhaiya commented Oct 27, 2018 reply Follow Share why do textbook book test series ask this type of questions? do you have any idea? 0 votes 0 votes Balaji Jegan commented Oct 27, 2018 reply Follow Share LOL. I never heard of "textbook" test series. :P 0 votes 0 votes Soumya Tiwari commented Oct 27, 2018 reply Follow Share I'm getting answer as option C. There's a tree called splay tree which is a type of balanced BST. Follow below link https://www.geeksforgeeks.org/splay-tree-set-1-insert/ 0 votes 0 votes Balaji Jegan commented Oct 27, 2018 i reshown by Balaji Jegan Oct 27, 2018 reply Follow Share Soumya Tiwari How u got C? Answer should be B 0 votes 0 votes Soumya Tiwari commented Oct 27, 2018 reply Follow Share 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. 1 votes 1 votes Lakshman Bhaiya commented Oct 27, 2018 reply Follow Share Yes $C$ is the right answer 0 votes 0 votes Balaji Jegan commented Oct 27, 2018 reply Follow Share Soumya Tiwari But splay trees are not height balanced. https://www.quora.com/How-do-splay-trees-balance-themselves 0 votes 0 votes Please log in or register to add a comment.