✦ LIBER ✦

Balance in trees

✍ Scribed by K.B. Reid; E. DePalma

Book ID: 108113505
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 150 KB
Volume: 304
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.09.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balance vertices in trees

✍ Reid, K. B. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

A new notion of balanced bipartitions of the vertices in a tree T is introduced and studied. It gives rise to a new central set of vertices in T, each of which can be considered to be a discrete version of the center of gravity of T. We seek vertices x, called balance vertices, such that the two sum

General Balanced Trees

✍ Arne Andersson 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 117 KB

We show that, in order to achieve efficient maintenance of a balanced binary search tree, no shape restriction other than a logarithmic height is required. The obtained class of trees, general balanced trees, may be maintained at a logarithmic amortized cost with no balance information stored in the

AVL Trees with Relaxed Balance

✍ Kim S. Larsen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 185 KB

The idea of relaxed balance is to uncouple the rebalancing in search trees from the updating in order to speed up request processing in main-memory databases. In this paper, we describe a relaxed version of AVL trees. We prove that each update gives rise to at most a logarithmic number of rebalancin

Embedding height balanced trees and Fibo

Embedding height balanced trees and Fibonacci trees in

✍ S. A. Choudum; Indhumathi Raman 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 610 KB

Insertion-safeness in balanced trees

✍ H.P. Kriegel; Y.S. Kwong 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Height balance distribution of search tr

Height balance distribution of search trees

✍ Ricardo A. Baeza-Yates 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 786 KB