Generation of Binary Trees from Ballot Sequences

  title={Generation of Binary Trees from Ballot Sequences},
  author={Doron Rotem and Yaakov L. Varol},
  journal={J. ACM},
An efficient algorithm for generating and indexing all shapes of n-noded binary trees is described The algorithm is based on a correspondence between binary trees and the class of stack-sortable permutations. together with a representation of such permutatmns as ballot sequences Justification for the related procedures is given, and their efficiency estabhshed by comparison to other approaches 

1 Figure or Table