Correspondence between stack permutations and internal node labels of tree codes representing binary trees
Mithun Muralidharan, H.V. Sahasrabuddhe · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 1982
We have presented an interesting correspondence between stack permutations and internal node labels of the tree codes representing binary trees. We found this relationship in the context of our work on developing a methodology for algorithm development through schema transformations, where we derived a set of algorithms for generating permutations (in different orders), and then adapted one of the permutation algorithms for generating stack permutations. It seems possible that a set of algorithms that generate stack permutations (in different orders) can be adapted by exploiting the correspondence discussed in this paper so as to generate all possible tree codes in different orders.