Permutation representation of k-ary trees

DOI10.1016/0304-3975(85)90211-7zbMath0572.68055OpenAlexW2073244180MaRDI QIDQ1062460

B. George

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90211-7

zbMATH Keywords

integer sequencestraversals

Mathematics Subject Classification ID

Trees (05C05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Coding Binary Trees by Words over an Alphabet with Four Letters ⋮ Is Prüfer Code Encoding Always a Bad Idea?

Cites Work

• Unnamed Item
• Unnamed Item
• Lexicographic generation of ordered trees
• Stack sortable permutations
• On a correspondence between binary trees and a certain type of permutation
• A numbering system for binary trees
• Generating Binary Trees Lexicographically
• Generation of Binary Trees from Ballot Sequences
• Ranking and Listing Algorithms for k-Ary Trees
• Generating t-Ary Trees Lexicographically

This page was built for publication: Permutation representation of k-ary trees