Tree Traversals and Permutations

Abstract

We build upon the previous work on the subset of permutations known as stack words and stack-sortable words. We use preorder, inorder and postorder traversals of binary trees to establish multiple bijections between binary trees and these words. We show these operators satisfy a sort of multiplicative cancellation. We further expand the study of these operators by demonstrating how properties on trees are related to properties on words.