Description: In this paper, a simple C language binary tree, each node only stores an integer, and, due to the very simple, is to determine the root of the tree, not imported. Determine the root after each number entered by the user are insert into the tree (-999 means stop), the use of depth-first approach. After the establishment of good binary tree, respectively, using depth-first (DFS) and breadth first (BFS) for the traverse,
To Search:
File list (Check if you may need any files):
erchashu\BiTree.h
........\BiTreeNode.h
........\主程序.cpp
erchashu
Download