data structures using example consider the splay tree given in fig searching for node in splay tree observe the change in its structure when node containing if particular node is present in the splay treethen pointer to is returned is searched in the tree otherwise pointer to the null node is returned the steps performed to search node in splay tree include ( ( ( figure splay tree search down the root of the splay tree looking for if the search is successfuland we reach nthen splay the tree at and return pointer to if the search is unsuccessfuli the splay tree does not contain nthen we reach null node splay the tree at the last non-null node reached during the search and return pointer to null deleting node from splay tree to delete node from splay treewe perform the following stepssearch for that has to be deleted if the search is unsuccessfulsplay the tree at the last non-null node encountered during the search if the search is successful and is not the root nodethen let be the parent of replace by an appropriate descendent of (as we do in binary search treefinally splay the tree at advantages and disadvantages of splay trees the advantages of using splay tree area splay tree gives good performance for searchinsertionand deletion operations this advantage centres on the fact that the splay tree is self-balancing and self-optimizing data structure in which the frequently accessed nodes are moved closer to the root so that they can be accessed quickly this advantage is particularly useful for implementing caches and garbage collection algorithms splay trees are considerably simpler to implement than the other self-balancing ( (bbinary search treessuch as red-black trees or avl treeswhile their averagefigure (asplay tree (bsplay tree case performance is just as efficient splay trees minimize memory requirements as they do not store any book-keeping data unlike other types of self-balancing treessplay trees provide good performance (amortized (log )with nodes containing identical keys example consider the splay tree at the left when we delete node from itthe new structure of the tree can be given as shown in the right side of fig (aafter splaying the tree at pthe resultant tree will be as shown in fig ( )