Description: Tree operations Daquan (source), including the four tree traversal, preorder traversal, inorder traversal, the follow-up traversal, traversal sequence, find the tree depth
To Search:
File list (Check if you may need any files):
树
..\二叉树
..\......\BiTNode.h
..\......\CBiTree.h
..\......\CreateBiTree.cpp
..\......\Debug
..\......\.....\CreateBiTree.obj
..\......\.....\CreateBiTree.sbr
..\......\.....\InOrderTraverse.obj
..\......\.....\InOrderTraverse.sbr
..\......\.....\LevelOrderTraverse.obj
..\......\.....\LevelOrderTraverse.sbr
..\......\.....\PostOrderTraverse.obj
..\......\.....\PostOrderTraverse.sbr
..\......\.....\PreOrderTraverse.obj
..\......\.....\PreOrderTraverse.sbr
..\......\.....\PrintElem.obj
..\......\.....\PrintElem.sbr
..\......\.....\PrintTree.obj
..\......\.....\PrintTree.sbr
..\......\.....\test.obj
..\......\.....\test.sbr
..\......\.....\vc60.idb
..\......\.....\vc60.pdb
..\......\.....\二叉树.bsc
..\......\.....\二叉树.exe
..\......\.....\二叉树.ilk
..\......\.....\二叉树.pch
..\......\.....\二叉树.pdb
..\......\InOrderTraverse.cpp
..\......\LevelOrderTraverse.cpp
..\......\PostOrderTraverse.cpp
..\......\PreOrderTraverse.cpp
..\......\PrintElem.cpp
..\......\PrintTree.cpp
..\......\resource.h
..\......\Script1.rc
..\......\test.cpp
..\......\二叉树.dsp
..\......\二叉树.dsw
..\......\二叉树.ncb
..\......\二叉树.opt
..\......\二叉树.plg
..\二叉树的非递归实现
..\二叉树的非递归实现.zip
..\..................\BiTNode.h
..\..................\CBiTree.h
..\..................\CCirQueue.cpp
..\..................\CCirQueue.h
..\..................\CreateBiTree.cpp
..\..................\Debug
..\..................\.....\CreateBiTree.obj
..\..................\.....\CreateBiTree.sbr
..\..................\.....\InOrderTraverse.obj
..\..................\.....\InOrderTraverse.sbr
..\..................\.....\IsBiTree.obj
..\..................\.....\IsBiTree.sbr
..\..................\.....\LeafNum.obj
..\..................\.....\LeafNum.sbr
..\..................\.....\LevelOrderTraverse.obj
..\..................\.....\LevelOrderTraverse.sbr
..\..................\.....\PostOrderTraverse.obj
..\..................\.....\PostOrderTraverse.sbr
..\..................\.....\PreOrderTraverse.obj
..\..................\.....\PreOrderTraverse.sbr
..\..................\.....\PrintElem.obj
..\..................\.....\PrintElem.sbr
..\..................\.....\pStackImple.obj
..\..................\.....\pStackImple.sbr
..\..................\.....\QueueImple.obj
..\..................\.....\QueueImple.sbr
..\..................\.....\test.obj
..\..................\.....\test.sbr
..\..................\.....\TreeLength.obj
..\..................\.....\TreeLength.sbr
..\..................\.....\TreeNum.obj
..\..................\.....\vc60.idb
..\..................\.....\vc60.pdb
..\..................\.....\二叉树的非递归实现.bsc
..\..................\.....\二叉树的非递归实现.exe
..\..................\.....\二叉树的非递归实现.ilk
..\..................\.....\二叉树的非递归实现.pch
..\..................\.....\二叉树的非递归实现.pdb
..\..................\implement.cpp
..\..................\InOrderTraverse.cpp
..\..................\IsBiTree.cpp
..\..................\LeafNum.cpp
..\..................\LevelOrderTraverse.cpp
..\..................\PostOrderTraverse.cpp
..\..................\PreOrderTraverse.cpp
..\..................\PrintElem.cpp
..\..................\pStack.h
..\..................\pStackImple.cpp
..\..................\QueueImple.cpp
..\..................\SCirQueue.h
..\..................\SQueue.h
..\..................\test.cpp
..\..................\TreeLength.cpp
..\..................\二叉树的非递归实现.dsp
..\..................\二叉树的非递归实现.dsw
Download