Thesis Details

Vyhledávání v AVL stromech v jazyce C

Bachelor's Thesis Student: Mintěl Tomáš Academic Year: 2006/2007 Supervisor: Honzík Jan M., prof. Ing., CSc.
English title
Searching in AVL Trees in C Language
Language
Czech
Abstract

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.

Keywords

AVL tree, searching, Pascal language, C language, C#, demonstrational animation, rotation

Department
Department of Information Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade B
Date
11 June 2007
Reviewer
Lukáš Roman, Ing., Ph.D.
Committee
Černocký Jan, prof. Dr. Ing. (DCGM FIT BUT), předseda
Křena Bohuslav, Ing., Ph.D. (DITS FIT BUT), člen
Kunovský Jiří, doc. Ing., CSc. (DITS FIT BUT), člen
Lukáš Roman, Ing., Ph.D. (DIFS FIT BUT), člen
Martinek David, Ing. (DIFS FIT BUT), člen
Sojka Petr, doc. RNDr., Ph.D. (FI MUNI), člen
Citation
MINTĚL, Tomáš. Vyhledávání v AVL stromech v jazyce C. Brno, 2007. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2007-06-11. Supervised by Honzík Jan M.. Available from: https://www.fit.vut.cz/study/thesis/4998/
BibTeX 
@bachelorsthesis{FITBT4998,
    author = "Tom\'{a}\v{s} Mint\v{e}l",
    type = "Bachelor's thesis",
    title = "Vyhled\'{a}v\'{a}n\'{i} v AVL stromech v jazyce C",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2007,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/4998/"
}

Theses

Back to top