notes consider the following binary search treesplay this tree at each of the following keys in turnd each part builds on the previousthat isuse the final tree of each solution as the starting tree for the next part "splay trees are binary search trees that achieve our goals by being self-adjusting in quite remarkable waydiscuss "it is possible that splay trees can become highly unbalancedso that single access to node of the tree can be quite expensiveexplain answersself assessment ( ( true true time complexity amortized costs (ln ( ) amortized analysis double further readings books brian kernighan and dennis ritchiethe programming languageprentice hall burkhard moniendata structures and efficient algorithmsthomas ottmannspringer krusedata structure program designprentice hall of indianew delhi mark allen welesdata structure algorithm analysis in csecond ed addisonwesley publishing rg dromeyhow to solve it by computercambridge university press shi-kuo changdata structures and algorithmsworld scientific shi-kuo changdata structures and algorithmsworld scientific sorenson and tremblayan introduction to data structure with algorithms lovely professional university