Description: Used to store binary tree binary tree, use the " expansion preorder sequence" to create the binary tree, the front of the binary tree, in traversing and traverse the level, the output of the sequence of the nodes and nodes 0,1,2 clues binary tree, binary tree to find clues of any node in binary precursor, successor, delete the binary tree node through clues tree, insert, and printed by the binary tree.
To Search:
File list (Check if you may need any files):
所有源程序\BiTree.h
..........\CreateBiTree.cpp
..........\Insert.cpp
..........\Inthread.cpp
..........\LevelOrderTraverse.cpp
..........\menu.cpp
..........\Order.cpp
..........\PrintTree.cpp
..........\TestMain.cpp
所有源程序
Download