搜索资源列表
Trees
- 用C++制作家谱-C production records
aglo7-1
- 二叉树的基本算法。(1) 输出二叉树B; (2) 输出二叉树B的深度; (3) 输出H结点的左、右孩子结点值; (4) 输出二叉树B的宽度; (5) 输出二叉树B的结点个数; 输出二叉树B的叶子结点个数 -The basic algorithm for binary tree。(1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes
Orderedtree
- 输入整数n,输出n个数组成的排列树的组合。-Enter integer n, output n number of trees formed a combination arrangement.
