wavl/thesis
Archived
1
0
Fork 0
Code Issues Pull requests Projects Releases 1 Wiki Activity

fix: abstract and keywords

Browse source 
Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2022-05-18 12:16:24 +02:00
parent 7cb34090ce
commit 12705360a1
Signed by: mfocko
GPG key ID: 7C47D46246790496
1 changed files with 3 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
thesis.tex
View file

@ -60,16 +60,10 @@
advisor = {prof. RNDr. Ivana Černá, CSc.}, advisor = {prof. RNDr. Ivana Černá, CSc.},
title = {Rank-Balanced Trees}, title = {Rank-Balanced Trees},
TeXtitle = {Rank-Balanced Trees}, TeXtitle = {Rank-Balanced Trees},
keywords = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, ...}, keywords = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, AVL, WAVL},
TeXkeywords = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, \ldots}, TeXkeywords = {algorithms, data structures, rank, trees, balanced trees, study material, visualization, AVL, WAVL},
abstract = {% abstract = {%
In the thesis we demonstrate usage of a rank for implementing balanced binary-search trees In this bachelor thesis, we demonstrate the usage of a rank for implementing balanced binary search trees and algorithms related to a specific rank-balanced tree, the weak AVL tree. In the first part of the thesis, we present commonly used balanced search trees. In the second part, we describe the rank-balanced tree, followed by a comparison to other balanced trees that can be implemented using rank, and also diagrams and pseudocodes related to the weak AVL tree. We also present an implementation of the weak AVL tree in Python, tested with property-based testing. The final part of the thesis is a web page that allows performing operations on the weak AVL tree with animations and a step-by-step walkthrough of pseudocode.
and algorithms related to a specific rank-balanced tree, the weak AVL tree. First part
of the thesis consists of description of the rank-balanced tree followed by a comparison
to other balanced trees that can be implemented using rank, diagrams and pseudo-codes related
to the weak AVL tree. We also present an implementation of the weak AVL tree in Python, tested with a
property-based testing. The final part of the thesis is a web-page that allows performing operations
on the weak AVL tree with animations and step-by-step walk-through of a pseudo-code.
}, },
thanks = {% thanks = {%
\textit{TBD} \textit{TBD}