Description: In this experiment, the input to the program is a table showing the generalized tree structure. Suppose root of the tree is root, its sub-tree forest F (T1, T2, ..., Tn), is set to L and the corresponding generalized tree table, L (atom, a child in Table 1, Table 2 child, ... child table n), in which the atoms correspond root, the child table i (1 <i< n ）对应 Ti 。例如：广义表 (a,(b,(c),(d)),(f,(g),(h ),(i))) 表示的树如图所示：
程序的输出为树的层次结构、树的度以及各种度的结点个数。
在输出树的层次结构时，先输出根结点，然后依次输出各个子树，每个子树向里缩进 4 个空格，如：针对上图表示的树，输出的内容应为：
To Search:
File list (Check if you may need any files):
9.树的建立与基本操作.cpp
Download