Description: Requires a list as a binary storage structure, the establishment of complete binary tree, the first order, the order and post order traversal of the operation, find all the leaf nodes and the total number of operation. Specific implementation requirements: the use of pre-order traversal, respectively, in-order traversal, built post-order traversal binary tree.
To Search:
File list (Check if you may need any files):
erchashu\btnode.cpp
........\btnode.dsp
........\btnode.dsw
........\btnode.ncb
........\btnode.opt
........\btnode.plg
........\Debug\btnode.exe
........\.....\btnode.ilk
........\.....\btnode.obj
........\.....\btnode.pch
........\.....\btnode.pdb
........\.....\vc60.idb
........\.....\vc60.pdb
........\Debug
erchashu
Download