Parallel algorithm for BST-tree balancing

Author: Nikoloz Grdzelidze
Keywords: BST, QBalance, Parallel
Annotation:

The report is about a parallel algorithm of binary search tree balances, in particular, will be offered the algorithm for the balancing algorithm developed within the PhD topic – Parallel Qbalance. Algorithm will be presented with a modified “tree to wine” method of binary search tree, which will provide the necessary environment for parallel algorithms. The report will present results of parallel algorithms with illustrations. The QBalance algorithm is implemented in the programming language C ++. New language skills are used within implementation and carried out in accordance with the code writing convention.

Lecture files:

მოხსენება [ka]