Generation of k-ary and (k,m)-ary Trees in A-order Using z-Sequences

Abstract

An algorithm is presented for generating trees in A-order using z-sequences series. This algorithm generates both k-ary and (k,m)-ary trees and it is the first algorithm which generates these trees independently from their structures. This algorithm has implemented in java with two classes completely and works successfully. I have used an array to store all information which are necessary about nodes. Both space and time complexities of this algorithm are optimal. © Springer-Verlag Berlin Heidelberg 2010.