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

作　　者：James F. Korsh James F. Korsh(Computer and Information Science Department, Temple University, Philadelphia, USA)

机构地区：[1]Computer and Information Science Department, Temple University, Philadelphia, USA

出　　处：《Applied Mathematics》2021年第12期1210-1215,共6页应用数学（英文）

摘　　要：<em>k</em>-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.<em>k</em>-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.

关 键 词：Combinatorial Problems k-Ary Trees Random Generation 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]