Abstract
An efficient algorithm for generating the P-sequences characterising all shapes of binary trees with n nodes is presented. This is based on the connection between the P-sequences and the ballot sequences. A P-sequence results from a ballot sequence if the integers 0, 1, 2,…,n−1 in ballot sequence is replaced by integers n, n−1, n−2, …, 1 in their corresponding positions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
