搜索资源列表
tree7
- tree-7实现了树型的注释(tooltips)，经典源码-tree-7 achieved a tree comments (tooltips), the classic source
tournament
- This assignment about data structure. This is write for linked-list and binary tree. This is useful for new-bie, who is begin ti learn about data structure.-This is assignment about data structure. This is write for linked-list and binary tree. This
tree3
- thies is a tree tree info file withw is ti veri slow form but enyqway fun
cnmb
- 在本实验中，程序的输入是一个表示树结构的广义表。假设树的根为 root ，其子树森林 F ＝ （ T1 ， T2 ， ... ， Tn ），设与该树对应的广义表为 L ，则 L ＝（原子，子表 1 ，子表 2 ， ... ，子表 n ），其中原子对应 root ，子表 i （ 1<i< n ）对应 Ti 。例如：广义表 (a,(b,(c),(d)),(f,(g),(h ),(i))) 表示的树如图所示： 程序的输出为树的层次结构、树的度以及各种度的结点个数。
PATA1053
- 给定一个带有根R的非空树，并赋给每个树节点TI的权重WI。从R到L的路径的重量被定义为从R到任何叶节点L的路径上所有节点的权重之和。(Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. The weight of a path from R to L is defined to be the sum of the weights of all the nodes along t