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.