Red-black tree balancing algorithms

Author: Giorgi Shvelidze
Co-authors: Nikoloz Grdzelidze
Keywords: Data structures, Binary search tree
Annotation:

Binary search trees are important data structures used in computer systems. Any improvement of algorithms or approaches related to binary search trees can result advantages in performance. Many data structures used in high-level programming languages or in computational geometry can be based on red–black trees, and the Completely Fair Scheduler used in current Linux kernels uses red–black trees. The master's thesis is about red-black tree balancing algorithms. Tests results will show advantages of our solution. We continue Nikoloz Grdzelidze's project. Goal of the project is to create data structure. For sufficiently big data it will be able to provide insertion and search fast.

Lecture files:

წითელ-შავი ხის დაბალანსების ალგორითმები [ka]