|
|
Preparation of Homeworks in the Course Algorithms
Felix, Martin ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about AVL trees, which belongs to the binary search trees. Thesis contains three parts, objective of the first one is to learn student how insert nodes into AVL trees in recursive way, objective of the second part is to learn student how delete nodes from AVL trees in non-recursive way and objective of the last one is to complete student's knowledge about AVL trees . Student's results are mached with results of model solution and this evaluation establishes student's points.
|
|
|
Searching in AVL Trees in C Language
Mintěl, Tomáš ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
This thesis engages in search in AVL tree. There are explained principles of researching methods. Consequently is in detail explained principle of utility AVL tree. The main aims of this thesis are transcribing non-recursive algorithms from Pascal to C language, create recursive analogies of this algorithms and create application for animated show of these operations.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
|
|
Searching in AVL Trees in C Language
Mintěl, Tomáš ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
This thesis engages in search in AVL tree. There are explained principles of researching methods. Consequently is in detail explained principle of utility AVL tree. The main aims of this thesis are transcribing non-recursive algorithms from Pascal to C language, create recursive analogies of this algorithms and create application for animated show of these operations.
|
|
|
Evaluation of Chosen Tree Search Methods
Tříska, Vít ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
A function to search is widely used operation in all possible forms. Recent developments show increasing importance of far more effective search methods. That is why this work deals with an evaluation of the fastest search methods at present time, namely AVL tree, red-black tree, splay tree and skip list. Moreover, it tries to recommend them for their correct usage. A supplementary goal of this thesis is to create a learning tool (study aid), which would facilitate better understanding of pitfalls of each individual search method.
|
|
|
Preparation of Homeworks in the Course Algorithms
Felix, Martin ; Goldefus, Filip (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about AVL trees, which belongs to the binary search trees. Thesis contains three parts, objective of the first one is to learn student how insert nodes into AVL trees in recursive way, objective of the second part is to learn student how delete nodes from AVL trees in non-recursive way and objective of the last one is to complete student's knowledge about AVL trees . Student's results are mached with results of model solution and this evaluation establishes student's points.
|
guest ::
