Pop \& Push: ordered tree iteration in O(1)-time

DOI10.4230/LIPICS.ISAAC.2022.53MaRDI QIDQ6602479zbMATH OpenFDO

Authors Paul W. Lapey, Aaron Williams

Publication date 11 September 2024

zbMATH Keywords

binary treesgray codeordered treescool-lex orderplane treesDyck wordsloopless algorithmcombinatorial generationCatalan objectssimultaneous gray code

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Pop \& Push: ordered tree iteration in \(\mathcal{O}(1)\)-time

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