Multi-mode binary search tree

Author: Giorgi Shvelidze
Keywords: Data structures, Binary search tree
Annotation:

Goal of the project is to create multi-mode binary search tree. For sufficiently big data it will be able to provide some binary search tree operations faster, than it is provided by well-known data structures such are Red-Black tree and AVL tree. We use current mode parameter in our tree class. If we want to append long list of elements to the tree, data structure will be transformed (in linear time) to Red-Black tree, which provides this operation in time of O(logN). If insertion is done and search has started data structure will be transformed (in linear time) to AVL tree, which provides the fastest search in binary trees. For sure, data has to be big enough to feel scalability and speed.