Pop \& Push: ordered tree iteration in \(\mathcal{O}(1)\)-time (Q6602479)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pop \& Push: ordered tree iteration in \(\mathcal{O}(1)\)-time |
scientific article; zbMATH DE number 7911119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pop \& Push: ordered tree iteration in \(\mathcal{O}(1)\)-time |
scientific article; zbMATH DE number 7911119 |
Statements
Pop \& Push: ordered tree iteration in \(\mathcal{O}(1)\)-time (English)
0 references
11 September 2024
0 references
combinatorial generation
0 references
gray code
0 references
simultaneous gray code
0 references
ordered trees
0 references
plane trees
0 references
Dyck words
0 references
binary trees
0 references
Catalan objects
0 references
loopless algorithm
0 references
cool-lex order
0 references
