Description: Binary tree is recursively defined, and its sub-tree nodes are so divided, there are five basic logical form of binary tree: (1) empty binary tree- (a) (2) there is only one root node Binary Tree- (b) (3) the right subtree of the binary tree is empty- (c) (4) the left subtree of the binary tree is empty- (d) (5) completely Binary Tree- (e) Note: Although the binary tree and the tree has many similarities, but not the tree, the special case of binary
To Search:
File list (Check if you may need any files):
二叉树\Debug\BuildLog.htm
......\.....\mt.dep
......\.....\StdAfx.obj
......\.....\vc60.idb
......\.....\vc60.pdb
......\.....\vc80.idb
......\.....\vc80.pdb
......\.....\二叉树.exe
......\.....\二叉树.exe.embed.manifest
......\.....\二叉树.exe.embed.manifest.res
......\.....\二叉树.exe.intermediate.manifest
......\.....\二叉树.ilk
......\.....\二叉树.obj
......\.....\二叉树.pch
......\.....\二叉树.pdb
......\ReadMe.txt
......\StdAfx.cpp
......\StdAfx.h
......\二叉树.cpp
......\二叉树.dsp
......\二叉树.dsw
......\二叉树.ncb
......\二叉树.opt
......\二叉树.plg
......\二叉树.sln
......\二叉树.suo
......\二叉树.vcproj
......\二叉树.vcproj.LENOVO-2395031B.gaojia.user
......\Debug
二叉树
Download