AN EFFICIENT ALGORITHM OF SYSTEMATIC GENERATING P-SEQUENCES BASED ON B SEQUENCES
Shi R · Computer Applications and Software · 1997
Both P-sequences and B-sequences can characterise al] shapes of binary trees with n internal nodes. Based on B-sequences, this paper proposes an efficient algorithm of systematic generating P-sequences. Really, a P-sequence can be obtained from a B-sequence representing the same binary tree, by replacing its integers 0, 1, ..., n-1 by the integers n, n-1, ..., 2, 1 in their corresponding positions.