Description: Binary tree Traversal (Traversal) refers to the search along a route, in turn, each node in the tree are one and only for a visit. Operations to do access nodes depends on the specific application.
To Search:
File list (Check if you may need any files):
tt
..\algorithm.cpp
..\algorithm.h
..\Debug
..\.....\algorithm.obj
..\.....\hough.obj
..\.....\huffman.obj
..\.....\image.obj
..\.....\julei.obj
..\.....\oo1.obj
..\.....\stack.obj
..\.....\tt.exe
..\.....\tt.ilk
..\.....\tt.pch
..\.....\tt.pdb
..\.....\vc60.idb
..\.....\vc60.pdb
..\.....\zuixiaoercheng.obj
..\F1.C
..\F2.C
..\F3.C
..\F4.C
..\hough.cpp
..\hough.h
..\huffman.cpp
..\huffman.h
..\image.cpp
..\image.h
..\julei.cpp
..\julei.h
..\oo.cpp
..\oo1.cpp
..\Release
..\.......\oo1.obj
..\.......\tt.exe
..\stack.cpp
..\stack.h
..\tt.dsp
..\tt.dsw
..\tt.ncb
..\tt.opt
..\tt.plg
..\zuixiaoercheng.cpp
..\zuixiaoercheng.h