Abstract
This paper presents a new algorithm for the generation of all n node t-ary trees in linked representation. It also gives two constant average time implementations of the algorithm. The first directly generates the next tree from its predecessor while the second retains additional information about the predecessor and is faster for t > 4.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
