说明：  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)