文件名称:erchashudebianli
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:3.5kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
1.对任意给定的二叉树(顶点数自定)建立它的二叉链表存储结构,并实现二叉树的先序、中序、后序三种遍历,输出三种遍历的结果。
2. 求二叉树高度、结点数、度为1的结点数和叶子结点数-1. On any given binary tree (top points from the set) to establish its binary linked list storage structure and to achieve binary tree preorder, inorder, postorder traversal of three, the output of three traverse results. 2. Find binary tree height, nodes, the number of nodes degree 1 nodes and leaves
2. 求二叉树高度、结点数、度为1的结点数和叶子结点数-1. On any given binary tree (top points from the set) to establish its binary linked list storage structure and to achieve binary tree preorder, inorder, postorder traversal of three, the output of three traverse results. 2. Find binary tree height, nodes, the number of nodes degree 1 nodes and leaves
(系统自动生成,下载前可以参看下载内容)
下载文件列表
erchashudebianli.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.