Improved Bounds on the Costs of Optimal and Balanced Binary Search Trees
A binary search tree can be used to store data in a computer system for retrieval by name. Different elements in the tree may be referenced with different probabilities. If we define the cost of the tree as the average number of elements which must be examined in searching for an element, then diffe...
Main Author: | Bayer, Paul J. |
---|---|
Other Authors: | Rivest, Ronald L. |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/148897 |
Similar Items
-
New bounds on optimal binary search trees
by: Harmon, Dion (Dion Kane)
Published: (2006) -
Combining Binary Search Trees
by: Demaine, Erik D., et al.
Published: (2014) -
The height of q-Binary Search Trees
by: Michael Drmota, et al.
Published: (2002-01-01) -
Hardware accelerator for feature matching with binary search tree
by: Thathsara, Miyuru, et al.
Published: (2024) -
Balanced Binary Tree Schemes for Computing Zernike Radial Polynomials
by: Hong-Yan Zhang, et al.
Published: (2023-01-01)