Description: Use two forks linked to achieve the basic functions of a binary tree: 1, the establishment of two binary tree, preorder traversal binary tree 3, 4 in order binary tree traversal, postorder binary tree 5, according to sequence traversal 2 Tree 6, find the depth of 7 binary tree, find the specified node to the root of the path 8, the destruction of binary tree
To Search:
File list (Check if you may need any files):
BiTree\BiTree\BiTree.cpp
......\......\BiTree.h
......\......\BiTree.vcproj
......\......\BiTree.vcproj.Eicho-Compaq.Eicho.user
......\......\Debug\BiTree.exe.intermediate.manifest
......\......\.....\BiTree.obj
......\......\.....\BuildLog.htm
......\......\.....\Main.obj
......\......\.....\mt.dep
......\......\.....\vc80.idb
......\......\.....\vc80.pdb
......\......\Debug
......\......\Main.cpp
......\BiTree
......\BiTree.ncb
......\BiTree.sln
......\BiTree.suo
......\debug\BiTree.exe
......\.....\BiTree.ilk
......\.....\BiTree.pdb
......\debug
BiTree
Download