Autor:	W. H. Hosken
Rok vydání:	1975
Předmět:	Combinatorics Discrete mathematics AVL tree K-ary tree Binary tree General Computer Science General Mathematics Optimal binary search tree Segment tree Exponential tree Interval tree Mathematics Range tree
Zdroj:	SIAM Journal on Computing. 4:341-347
ISSN:	1095-7111 0097-5397
DOI:	10.1137/0204029
Popis:	We consider the problem of finding the best partition of a binary tree addressing structure where the maximum block size is given and a one-block buffer is available. An algorithm is presented for finding an optimum partition. The algorithm operates in time proportional to $N \cdot n^2 $, where N is the number of nodes in the tree and n is the block size.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::aeb12b313259d786a3eaa482a2dca9e8 https://doi.org/10.1137/0204029 Zobrazit plný text záznamu