Ranking and Unranking of AVL-Trees

DOI10.1137/0215073zbMATH Open0619.68041OpenAlexW1976120119MaRDI QIDQ3756519FDOQ3756519

Authors: Liwu Li 

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215073

Recommendations

• Ranking and unranking trees using regular reductions
• A note on generating binary trees inA-order andB-order
• Generating t-ary trees in A-order
• scientific article; zbMATH DE number 4008409
• Ranking and Unranking of Non-regular Trees

zbMATH Keywords

algorithmrankingunrankingAVL-trees

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited In (9)

• Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
• Ranking and unranking trees using regular reductions
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
• Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
• Generation, ranking and unranking of ordered trees with degree bounds
• On generating B-trees with constant average delay and in lexicographic order
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• Ranking and unranking bordered and unbordered words
• Two Algorithms for Unranking Arborescences

This page was built for publication: Ranking and Unranking of AVL-Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3756519)