Enumeration and succinct encoding of AVL trees

DOI10.4230/LIPICS.AOFA.2024.2MaRDI QIDQ6865698zbMATH OpenFDO

Authors Jeremy Chizewer, Stephen Melczer, J. Ian Munro, Ava Pun

Publication date 30 January 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.AOFA.2024.2

zbMATH Keywords

analytic combinatoricsAVL treesenumerationsuccinct data structures

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites work

• A uniform paradigm to succinctly encode various families of trees
• An invitation to analytic combinatorics. From one to several variables
• Analytic combinatorics
• Foundations of software technology and theoretical computer science. 16th conference, Hyderabad, India, December 18--20, 1996. Proceedings
• scientific article; zbMATH DE number 3865301 (Why is no real title available?)
• scientific article; zbMATH DE number 7740925 (Why is no real title available?)
• Representing dynamic binary trees succinctly
• Succinct Ordinal Trees Based on Tree Covering

Cited in

(1)

• Succinct encodings of binary trees with application to AVL trees

This page was built for publication: Enumeration and succinct encoding of AVL trees

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