Abstract
We define Ballot-sequences for t-ary trees based on the ideas of Ballot-sequences of binary trees presented by Rotem. Later an efficient algorithm for the generation of t-ary trees with Ballot-sequences in B-order is presented. The algorithm generates each sequence in constant average time O(1), and the sequences are generated in lexicographical order. The ranking and unranking algorithms with O(tn) time complexity are also described.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
