๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Ranking and Unranking of 2-3 Trees

โœ Scribed by Gupta, Udai; Lee, D. T.; Wong, C. K.


Book ID
118174092
Publisher
Society for Industrial and Applied Mathematics
Year
1982
Tongue
English
Weight
845 KB
Volume
11
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Ranking and unranking of B-trees
โœ U.I Gupta; D.T Lee; C.K Wong ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 520 KB
Ranking and Unranking of AVL-Trees
โœ Li, Liwu ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 987 KB
Ranking and unranking of non-regular tre
โœ Ro-Yu Wu; Jou-Ming Chang; Chir-Ho Chang ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 426 KB

Ordered trees are called non-regular trees with a prescribed branching sequence (or nonregular trees for short) if their internal nodes have a pre-specified degree sequence in preorder list. This article presents two main results. First, we develop a simple algorithm to generate all non-regular tree