National Repository of Grey Literature 2 records found  Search took 0.00 seconds. 
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.
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.