资 源 简 介
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