Ranking and Unranking of AVL-Trees

DOI10.1137/0215073zbMath0619.68041OpenAlexW1976120119MaRDI QIDQ3756519

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

zbMATH Keywords

algorithmrankingunrankingAVL-trees

Mathematics Subject Classification ID

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

Related Items (6)

Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Ranking and unranking bordered and unbordered words ⋮ Unnamed Item ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order ⋮ On generating B-trees with constant average delay and in lexicographic order

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