Abstract
Many algorithms have been developed to generate sequences for trees, and a few are to generate trees themselves, i.e., in computer representation. Two new algorithms are presented in this paper to generate k-ary trees in computer representation. One is recursive with constant average time per tree and the other is loopless (non-recursive) with constant time per tree. Both of them are simple and able to be understood easily.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
