𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A comparative study of 2-3 trees and AVL trees

✍ Scribed by Ahmed S. Zaki

Publisher
Springer
Year
1983
Tongue
English
Weight
868 KB
Volume
12
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A study of graph spectra for comparing g
A study of graph spectra for comparing graphs and trees
✍ Richard C. Wilson; Ping Zhu πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 554 KB

The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a graph representation for pattern matching since it is invariant to the labelling of the graph. There are, however, a numbe

A study of random Weyl trees
A study of random Weyl trees
✍ Luc Devroye; Amar Goudjil πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 261 KB πŸ‘ 2 views

We study binary search trees constructed from Weyl sequences n , n G 1, Γ„ 4 where is an irrational and ΠΈ denotes ''mod 1.'' We explore various properties of the structure of these trees, and relate them to the continued fraction expansion of . If H is n w x the height of the tree with n nodes when i

A classification of plane and planar 2-t
A classification of plane and planar 2-trees
✍ G. Labelle; C. Lamathe; P. Leroux πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 365 KB

We present new functional equations for the species of plane and of planar (in the sense of Harary and Palmer, Graphical Enumeration, Academic Press, New York, 1973) 2-trees and some associated pointed species. We then deduce the explicit molecular expansion of these species, i.e. a classiΓΏcation of

A Characterization of the degree sequenc
A Characterization of the degree sequences of 2-trees
✍ Prosenjit Bose; Vida Dujmovi; Danny Krizanc; Stefan Langerman; Pat Morin; David πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 260 KB πŸ‘ 1 views

## Abstract A graph __G__ is a 2‐tree if __G__ = __K__~3~, or __G__ has a vertex __v__ of degree 2, whose neighbors are adjacent, and __G__/ __v__ is a 2‐ tree. A characterization of the degree sequences of 2‐trees is given. This characterization yields a linear‐time algorithm for recognizing and r