Question: Unlike balanced search trees(BST), splay trees incur overhead during a find operation that can be undesirable if the access sequence is sufficiently random. Experiment with a strategy that splays on a find operation only after a certain depth d is traversed in the top-down search. The splay does not move the accessed item all the way to the root, but rather to the point at depth d where the splaying is started.