Description: Some binary basic steps: 1) pre-order traversal: preorder output binary tree before the press
2) preorder: the binary output pre-order traversal
3) After preorder: the binary output pre-order traversal
4) Layer preorder: the binary output pre-order traversal
5) Find the height: height obtained binary tree
6) Find the maximum width: find the maximum width of the binary tree
7) to determine whether a full binary tree: determining whether the input binary full binary tree
To Search:
File list (Check if you may need any files):
BiTree
......\BiTree.cpp
......\BiTree.dsp
......\BiTree.dsw
......\BiTree.ncb
......\BiTree.opt
......\BiTree.plg
......\Debug
......\.....\BiTree.exe
......\.....\BiTree.ilk
......\.....\BiTree.obj
......\.....\BiTree.pch
......\.....\BiTree.pdb
......\.....\vc60.idb
......\.....\vc60.pdb
二叉树应用问题设计方案.doc
Download