说明:建立二叉树,用四种方法遍历,求二叉树的树高及结点总权,并且能输入一个结点求其父结点(The two forked tree is required to be traversed by four methods, and the height of the two forked tree and the total weight of the node are calculated, and a node can be entered to find the parent node of the
<赵自由> 在 上传
| 大小:1.76mb | 下载:0