Description: According to a binary tree definition of abstract data types, use two forks to achieve a binary tree list. 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 a binary tree traversal sequence 6, seeking binary tree of depth 7, find the specified node to the root of the path 8, the destruction of binary 9, Other: Custom Actions
To Search:
File list (Check if you may need any files):
实验3\07104班13号邹衍芳实验3二叉树.doc
.....\Debug\Sort.obj
.....\.....\Tree.exe
.....\.....\Tree.ilk
.....\.....\Tree.obj
.....\.....\Tree.pch
.....\.....\Tree.pdb
.....\.....\vc60.idb
.....\.....\vc60.pdb
.....\Tree.cpp
.....\Tree.dsp
.....\Tree.dsw
.....\Tree.ncb
.....\Tree.opt
.....\Tree.plg
.....\Debug
实验3
Download