Description: According to the abstract data type binary definition, use two forks to implement a binary tree list. The basic function of a binary tree: 1, build the binary tree 2, 3, before traversing a binary tree, binary tree traversal in the order 4, 5, after traversing a binary tree, binary tree traversal according to the sequence 6, find binary tree of depth 7, find the specified path to the root node 8, the destruction of binary tree
To Search:
- [bitree-tra] - binary tree to achieve, including Traver
File list (Check if you may need any files):
Binary＿Tree\BiTree.cpp
............\BiTree.h
............\Debug\BiTree.obj
............\.....\vc60.idb
............\.....\vc60.pdb
............\.....\二叉树.exe
............\.....\二叉树.ilk
............\.....\二叉树.obj
............\.....\二叉树.pdb
............\二叉树.cpp
............\二叉树.dsp
............\二叉树.dsw
............\二叉树.ncb
............\二叉树.opt
............\二叉树.plg
............\Debug
Binary＿Tree
Download