On the generation of P-sequences

References

• Pallo , J. and Racca , R. 1985 . A note on generating binary tree in A-order and B-order . Intern. J. Computer Math. , 18 : 27 – 39 .
   Web of Science ®Google Scholar
• Rotem , D. and Varol , Y. L. 1978 . Generation of binary trees from ballot sequences . JACM , 25 ( no. 3 ) : 396 – 404 .
   Google Scholar
• Rusky , F. and Hu , T. C. 1977 . Generating binary trees lexicographically . SIAM J. Comput. , 6 ( no. 4 ) : 745 – 748 .
   Web of Science ®Google Scholar
• Zaks , S. 1980 . Lexicographic generation of ordered trees . Theoretical Computer Science , 10 : 63 – 82 .
   Web of Science ®Google Scholar
• Knuth , D. E. 1919 . “ The art of computer programming ” . In Fundamental Algorithms , Vol. 1 , Reading, MA : Addison-Wesley .
   Google Scholar
• Knott , G. D. 1977 . A numbering system for binary trees . Comm. ACM , 20 ( no.2 ) : 113 – 115 .
   Web of Science ®Google Scholar