Očekávaná výška binárních vyhledávacích stromů
In this thesis we study the expected height and some other qualities of the binary serach trees. We make the inquiry about the expected height by skewed trees and by the two probably best-known and most widely used variations of the balanced trees, it means the AVL and the red-black trees. In additi...
Main Author: | |
---|---|
Other Authors: | |
Format: | Dissertation |
Language: | Czech |
Published: |
2010
|
Online Access: | http://www.nusl.cz/ntk/nusl-276395 |
id |
ndltd-nusl.cz-oai-invenio.nusl.cz-276395 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-nusl.cz-oai-invenio.nusl.cz-2763952017-06-27T04:39:52Z Očekávaná výška binárních vyhledávacích stromů Expected height of binary search trees Langhammer, Martin Koubková, Alena Koubek, Václav In this thesis we study the expected height and some other qualities of the binary serach trees. We make the inquiry about the expected height by skewed trees and by the two probably best-known and most widely used variations of the balanced trees, it means the AVL and the red-black trees. In addition to the value of the expected height of the trees we found out the scatter of the tree heights and some other statistics. In this thesis we attach to experimental solution of the problems. We also write down all the theoretical results that were known to us. We focus especially on comparing the measured values with the theoretically counted results. We try to acquire as exact assessment as possible in the case of unexisting theoretical results. Besides we compare the di erences between the various trees. We measured speeds of the tree's generation only marginally. We also inquire the dependence on di erent kinds of enter data within the experiments, such as the sorted data or generated data from various sorts of division. We use the standard statistic methods for the interpretation of the results, especially the method of linear regression. 2010 info:eu-repo/semantics/masterThesis http://www.nusl.cz/ntk/nusl-276395 cze info:eu-repo/semantics/restrictedAccess |
collection |
NDLTD |
language |
Czech |
format |
Dissertation |
sources |
NDLTD |
description |
In this thesis we study the expected height and some other qualities of the binary serach trees. We make the inquiry about the expected height by skewed trees and by the two probably best-known and most widely used variations of the balanced trees, it means the AVL and the red-black trees. In addition to the value of the expected height of the trees we found out the scatter of the tree heights and some other statistics. In this thesis we attach to experimental solution of the problems. We also write down all the theoretical results that were known to us. We focus especially on comparing the measured values with the theoretically counted results. We try to acquire as exact assessment as possible in the case of unexisting theoretical results. Besides we compare the di erences between the various trees. We measured speeds of the tree's generation only marginally. We also inquire the dependence on di erent kinds of enter data within the experiments, such as the sorted data or generated data from various sorts of division. We use the standard statistic methods for the interpretation of the results, especially the method of linear regression. |
author2 |
Koubková, Alena |
author_facet |
Koubková, Alena Langhammer, Martin |
author |
Langhammer, Martin |
spellingShingle |
Langhammer, Martin Očekávaná výška binárních vyhledávacích stromů |
author_sort |
Langhammer, Martin |
title |
Očekávaná výška binárních vyhledávacích stromů |
title_short |
Očekávaná výška binárních vyhledávacích stromů |
title_full |
Očekávaná výška binárních vyhledávacích stromů |
title_fullStr |
Očekávaná výška binárních vyhledávacích stromů |
title_full_unstemmed |
Očekávaná výška binárních vyhledávacích stromů |
title_sort |
očekávaná výška binárních vyhledávacích stromů |
publishDate |
2010 |
url |
http://www.nusl.cz/ntk/nusl-276395 |
work_keys_str_mv |
AT langhammermartin ocekavanavyskabinarnichvyhledavacichstromu AT langhammermartin expectedheightofbinarysearchtrees |
_version_ |
1718468084566589440 |