Description: A binary list storage structure, written preamble, inorder, postorder and level order traversal of a binary tree algorithm.
2 binary linked list storage structure, written to calculate the binary tree depth, the total number of all nodes, leaf nodes, the number of two-child node, the number of single-child node algorithm
Preorder, inorder, postorder and level order traversal of a binary tree algorithm non-recursive (stack or queue)
To Search:
File list (Check if you may need any files):
树与森林
........\Debug
........\.....\树与森林.exe
........\.....\树与森林.ilk
........\.....\树与森林.pdb
........\树与森林
........\........\Debug
........\........\.....\BuildLog.htm
........\........\.....\Tree.obj
........\........\.....\main.obj
........\........\.....\mt.dep
........\........\.....\vc90.idb
........\........\.....\vc90.pdb
........\........\.....\树与森林.exe.intermediate.manifest
........\........\Tree.cpp
........\........\Tree.h
........\........\main.cpp
........\........\queue.h
........\........\树与森林.vcproj
........\........\树与森林.vcproj.PC-20120218GURE.Administrator.user
........\........\树与森林.vcproj.cse-202-49.Administrator.user
........\树与森林.ncb
........\树与森林.sln
........\树与森林.suo
Download