Encoding search trees in lists†

DOI10.1080/00207168208803285zbMath0481.68030OpenAlexW1977873972MaRDI QIDQ3939219

Vijay K. Vaishnavi, Derick Wood

Publication date: 1982

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168208803285

zbMATH Keywords

data encodingoptimal encodingstranslation of logical data structures to physical storage structures

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items

Unnamed Item, Encoding search trees in lists^†

Cites Work

• Uniform data encodings
• Data encodings and their costs
• Encoding Data Structures in Trees
• Storage representations for tree-like data structures
• Encoding search trees in lists^†
• Preserving average proximity in arrays
• A comparison of two methods of encoding arrays
• Bounds on the costs of data encodings