Results 291 to 300 of about 688,249 (334)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Rebalancing Height Balanced Trees
IEEE Transactions on Computers, 1978A new balancing technique for binary search trees is presented, based on the repositioning of k + 1 nodes (k-rotation) Some properties of k-rotation are shown, and bounds to k are derived. The performance of such a technique is discussed on the basis of the length of node search and the frequency of tree rebalancing.
LUCCIO F, PAGLI, LINDA
openaire +3 more sources
Nature, 2004
Trees grow tall where resources are abundant, stresses are minor, and competition for light places a premium on height growth. The height to which trees can grow and the biophysical determinants of maximum height are poorly understood. Some models predict heights of up to 120 m in the absence of mechanical damage, but there are historical accounts of ...
Stephen C Sillett
exaly +3 more sources
Trees grow tall where resources are abundant, stresses are minor, and competition for light places a premium on height growth. The height to which trees can grow and the biophysical determinants of maximum height are poorly understood. Some models predict heights of up to 120 m in the absence of mechanical damage, but there are historical accounts of ...
Stephen C Sillett
exaly +3 more sources
On the Height of Height-Balanced Trees
IEEE Transactions on Computers, 1976Height-balanced binary trees with height unbalances up to ? are investigated, and the asymptotic value of the height h of such trees is studied for an increasing number of nodes N. It is shown that, in the worst case, the asymptotic value of h is a logarithmic function of N: [h = K log N] n?? . Specifically, an upper bound for h can be posed as: h ?
Luccio, Fabrizio, Pagli, Linda
openaire +1 more source
Computing, 1979
The class of height balanced 2–3 trees is defined. This class properly contains the class of 2–3 trees. Insertion and deletion algorithms for these trees having 0 (logn) performance are provided. This paper thus, effectively demonstrates that “height balancing” can be usefully applied to classes of trees other than binary trees, which is a contribution
Vaishnavi, V. K. +2 more
openaire +1 more source
The class of height balanced 2–3 trees is defined. This class properly contains the class of 2–3 trees. Insertion and deletion algorithms for these trees having 0 (logn) performance are provided. This paper thus, effectively demonstrates that “height balancing” can be usefully applied to classes of trees other than binary trees, which is a contribution
Vaishnavi, V. K. +2 more
openaire +1 more source
Height-balanced multiway trees
Information Systems, 1979Abstract A typical class of structures to organize ordered files is multiway trees, among which the most widely used is the perfectly balanced B-tree. In this paper we present the new family of BMT multiway trees, which are kept balanced in height, similarly to the classical binary height balanced trees used in central memory.
openaire +1 more source
Multidimensional Height-Balanced Trees
IEEE Transactions on Computers, 1984A new multidimensional balanced tree structure is presented for the efficient management of multidimensional data. It is shown that the data structure can be used to manage a set of n k-dimensional records or data items such that the records can be searched or updated in O(log2 n) + k time, which is optimal.
openaire +1 more source
Nature Geoscience, 2018
Tall trees are more resilient to drought than short trees, suggests a comparison of the sensitivity of photosynthesis to soil moisture in Amazon forests.
openaire +1 more source
Tall trees are more resilient to drought than short trees, suggests a comparison of the sensitivity of photosynthesis to soil moisture in Amazon forests.
openaire +1 more source