Welcome![Sign In][Sign Up]
Location:
Search - cengxubianlierchashu

Search list

[Other resourcecengxubianlierchashu

Description: shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用,所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedures at the beginning of each user input first-sequence binary tree nodes value, for the importation of empty node by right-ENDTAG value (tentatively scheduled for integer 0). After a good binary tree can be automatically traversal sequence followed output of the node values. ---- Author : zhg 2006.11.26 E-mail : wudazhg@163.com for reference purposes only learning, retention of title
Platform: | Size: 12671 | Author: zhg | Hits:

[Other resourceLevelTraverse-cengxubianlierchashu

Description: LevelTraverse.c 上次写的“cengxubianlierchashu.rar(二叉树层序遍历程序)”遍历不能将二叉树的所有结点都遍历,现对其做了微小修改,并调试好。本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,建立好二叉树后即可自动进行遍历依次层序输出各结点的值.----Author:zhg 2006.12 E-mail:wudazhg@163.com -LevelTraverse.c last book, "cengxubianlierch ashu.rar (binary tree traversal sequence procedures) "can not be binary tree traversal of all the nodes are traversal, now its a minor modification, and debugging good. The procedures for the binary tree traversal sequence. Procedures at the beginning of each user input first-sequence binary tree nodes value, After a good binary tree can be automatically followed traversal sequence output of the node values .---- Author : zhg 2006.12 E-mail : wudazhg@163.com
Platform: | Size: 10439 | Author: z | Hits:

[Data structscengxubianlierchashu

Description: shi.c 说明:本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,对于空结点输入宏ENDTAG所对的值(暂定为整数0). 建立好二叉树后即可自动进行遍历依次层序输出各结点的值. ----Author:zhg 2006.11.26 E-mail: wudazhg@163.com 仅供参考学习之用,所有权保留-shi.c : The procedures for the binary tree traversal sequence. procedures at the beginning of each user input first-sequence binary tree nodes value, for the importation of empty node by right-ENDTAG value (tentatively scheduled for integer 0). After a good binary tree can be automatically traversal sequence followed output of the node values.---- Author : zhg 2006.11.26 E-mail : wudazhg@163.com for reference purposes only learning, retention of title
Platform: | Size: 12288 | Author: zhg | Hits:

[Data structsLevelTraverse-cengxubianlierchashu

Description: LevelTraverse.c 上次写的“cengxubianlierchashu.rar(二叉树层序遍历程序)”遍历不能将二叉树的所有结点都遍历,现对其做了微小修改,并调试好。本程序用于层序遍历二叉树.程序开始时先由用户先根序输入二叉树各结点值,建立好二叉树后即可自动进行遍历依次层序输出各结点的值.----Author:zhg 2006.12 E-mail:wudazhg@163.com -LevelTraverse.c last book, "cengxubianlierch ashu.rar (binary tree traversal sequence procedures) "can not be binary tree traversal of all the nodes are traversal, now its a minor modification, and debugging good. The procedures for the binary tree traversal sequence. Procedures at the beginning of each user input first-sequence binary tree nodes value, After a good binary tree can be automatically followed traversal sequence output of the node values .---- Author : zhg 2006.12 E-mail : wudazhg@163.com
Platform: | Size: 10240 | Author: z | Hits:

[Data structscengxubianlierchashu

Description: ,该程序的功能是实现二叉树结点的类型定义和对二叉树的基本操作。该程序包括二叉树结构类型以及每一种操作的具体的函数定义和主函数。 -, The program
Platform: | Size: 1024 | Author: 刘慧 | Hits:

CodeBus www.codebus.net