Summary We discuss two simple strategies for constructing binary search trees: Place the most frequently occurring name at the root of the tree, then proceed similary on the subtrees and choose the root so as to equalize the total weight of the left and right subtrees as much as possible, then proceed similarly on the subtres. While the former rule may yield extremely inefficient search trees, the latter rule always produces nearly optimal trees
Improving the efficiency of retrieving information concerns users of computer systems involved in ma...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:14:30Z No. of bitstreams:...
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of gener...
Summary We discuss two simple strategies for constructing binary search trees: Place the most frequ...
Summary We discuss two simple strategies for constructing binary search trees: Place the most freq...
AbstractWe consider the problem of building optimal binary search trees. The binary search tree is a...
Abstract. We give linear-time algorithms for re-ordering and height-restricting a binary search tree...
We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only...
We discuss several simple strategies for constructing binary search trees. Upper and lower bounds fo...
+ Appendix Yosi Ben-Asher, Eitan Farchi, y Ilan Newman z , Abstract It is well known that th...
This paper presents an object–oriented approach to the problem of finding optimal binary search tree...
Hu-Tucker alogorithm for building optimal alphabetic binary search trees Sashka Davis Follow this an...
Abstract. The weighted path length of optimum binary search trees is bounded above by Y’./3i +2 a. +...
An algorithm is presented which constructs an optimal binary search tree for an ordered list of n it...
We address the extension of the binary search technique from sorted arrays and totally ordered sets ...
Improving the efficiency of retrieving information concerns users of computer systems involved in ma...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:14:30Z No. of bitstreams:...
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of gener...
Summary We discuss two simple strategies for constructing binary search trees: Place the most frequ...
Summary We discuss two simple strategies for constructing binary search trees: Place the most freq...
AbstractWe consider the problem of building optimal binary search trees. The binary search tree is a...
Abstract. We give linear-time algorithms for re-ordering and height-restricting a binary search tree...
We give linear-time algorithms for re-ordering and heightrestricting a binary search tree with only...
We discuss several simple strategies for constructing binary search trees. Upper and lower bounds fo...
+ Appendix Yosi Ben-Asher, Eitan Farchi, y Ilan Newman z , Abstract It is well known that th...
This paper presents an object–oriented approach to the problem of finding optimal binary search tree...
Hu-Tucker alogorithm for building optimal alphabetic binary search trees Sashka Davis Follow this an...
Abstract. The weighted path length of optimum binary search trees is bounded above by Y’./3i +2 a. +...
An algorithm is presented which constructs an optimal binary search tree for an ordered list of n it...
We address the extension of the binary search technique from sorted arrays and totally ordered sets ...
Improving the efficiency of retrieving information concerns users of computer systems involved in ma...
Submitted by Elaine Almeida (elaine.almeida@nce.ufrj.br) on 2017-08-04T13:14:30Z No. of bitstreams:...
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of gener...
DOI
Add to ORKG