keywords notes access timethe time required to access and retrieve word from high-speed memory is few microseconds at most splay treessplay trees are binary search trees which are self adjusting self assessment choose the appropriate answer splay trees were invented by (asleator (btarjan (cnewton (dboth (aand (bthe run time for each operation is essentially the same as for (asplay operation (bzero operation (cplay operation (dnone of the above state whether the following statements are true or false the time complexity of maintaining splay tree is analyzed using an amortized analysis each node does not contain character fill in the blanks the of maintaining splay tree is analyzed using an amortized analysis the trick of the analysis is to define potential function and to show that each splay operation has the key to is to define the right potential function there are two kinds of rotations and one single rotation review questions explain splay operation in splay trees "the time complexity of maintaining splay tree is analyzed using an amortized analysis explain " splay tree does not keep track of heights and does not use any balance factors like an avl treeexplain lovely professional university