Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have