Tree traversals and permutations

MaRDI QIDQ3378235zbMATH OpenFDO

Authors Todd Feil, Kevin R. Hutson, R. Matthew Kretchmar

Publication date 30 March 2006

zbMATH Keywords

bijectionsbinary treesinorderpattern-avoiding permutationspostorderpreorderstack wordsstack-sortable words

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Trees (05C05)

Recommendations

• scientific article; zbMATH DE number 892276
• Priority queue sorting and labeled trees
• Permutation representation of k-ary trees
• Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations
• scientific article; zbMATH DE number 1156636

Cited in

(8)

• Permutation representation of k-ary trees
• Scaffold permutations
• How to sort by walking and swapping on paths and trees
• Noncontiguous pattern containment in binary trees
• Ordered trees and the inorder traversal
• Perfect trees and bit-reversal permutations
• scientific article; zbMATH DE number 871445 (Why is no real title available?)
• Tree expansion in time-dependent perturbation theory

This page was built for publication: Tree traversals and permutations

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