LOOPLESS GENERATION OF K-ARY TREE SEQUENCES

作     者：KORSH, JF 

作者机构：Department of Computer and Information Science Temple University Computer Activity Building Broad and Montgomery Streets Philadelphia PA 19122 USA 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：1994年第52卷第5期

页      面：243-247页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：COMBINATORIAL PROBLEMS COMBINATORIAL ALGORITHMS DATA STRUCTURES BINARY TREES TREES LOOPLESS GENERATION 

摘      要：Roelants van Baronaigien (1991) gave an algorithm to generate all n-node binary tree representations with constant time between them. He used the well-known rotation operation on nodes for balancing binary search trees and represented binary trees by binary tree sequences. This paper generalizes the rotation to k-ary trees and uses it to generate k-ary tree representations with constant time between them.