Counting and Randomly Generating <i>k</i>-Ary Trees

Korsh, James F. (2021) Counting and Randomly Generating <i>k</i>-Ary Trees. Applied Mathematics, 12 (12). pp. 1210-1215. ISSN 2152-7385

[thumbnail of am_2021122213413624.pdf] Text
am_2021122213413624.pdf - Published Version
Download (359kB)

Abstract

k-ary trees are one of the most basic data structures in Computer Science. A new method is presented to determine how many there are with n nodes. This method gives additional insight into their structure and provides a new algo-rithm to efficiently generate such a tree randomly.

Item Type: Article
Subjects: Scholar Eprints > Mathematical Science
Depositing User: Managing Editor
Date Deposited: 02 Dec 2022 04:31
Last Modified: 12 Aug 2024 12:16
URI: http://repository.stmscientificarchives.com/id/eprint/554

Actions (login required)

View Item
View Item