Description: Programming, first of all to establish a lead as follows node chain store binary tree structure, and then the tree after 90 degrees clockwise on the screen print of the tree, and then the output sequence, respectively, in accordance with the preceding times calendar (including recursive and non-recursive two methods), in order traversal, after traversal and traversal methods such as the level of binary tree traversal order of visits to the sequence of node information, and verify that the results are correct or not, and to achieve in the tree to find a node data.
To Search:
File list (Check if you may need any files):
树
..\BiTree.h
..\BiTreeTraverse.h
..\LinQueue.h
..\LinStack.h
..\Queue层次遍历.c
..\Stack先序遍历.c
..\叶结点个数.c
..\完全二叉树.c
..\查找.c
..\第12周实验说明 二叉树算法.doc
Download