Essay Example on Binary Search Tree Implementation BST

It is double right rotation of nodes i e every node is moved two positions to the right of its current position Zag Zag Rotation It is double left rotation of nodes i e every node is moved two positions to the left of its current position Zig Zag Rotation Zigs followed by Zags is called Zig Zag rotation i e for every zig right shift there is a zag left shift Zag Zig Rotation Zags followed by Zigs is called Zag Zig rotation i e for every zag left shift there is a zig right shift Feasibility Study This project is on Splay trees which is an obscure binary search tree meaning it is not used as frequently as most of the other binary search trees like AVL trees simple binary search tress etc This project is to use Splay tress and thus provide with implementations at which this can be used and thus outperform other widely used trees in some of the defined areas This tree is useful 1 To access frequently accessed items as they are easy to find because Splay trees have excellent locality properties 2 They are simpler as they don t have any extra field like other binary search trees 3 

They can change with read only operations like search also Need of Splay Trees 1 Splay trees have excellent locality properties 2 They are the fastest types of BST s for many applications Significance of Splay Trees They are the more efficient than other type of BSTs because of their excellent locality properties Splay tress achieve this by exploiting temporal locality i e the recently accessed items will be at the top of the tree Splay trees can perform at its best in the following implementations With network routers in which IP addresses of the recently used might be used again or maybe many times in the future thus it will be at a height above the others They are already being used in Windows NT in the system codes networking virtual memory etc They are used in the GCC complier They are used in the GNU C library They can be used in implementing caches They can be used in garbage collectors BIBLIOGRAPHY http www cs cornell edu courses cs312 2008sp lectures lec25 html https people eecs berkeley edu jrs 61b lec 36 http btechsmartclass com DS U5_T5 html www youtube com www wikipedia com