Description: Also known as binary search tree. It is either an empty tree or the nature of the binary tree with the following: (1) If the left subtree is not empty, then the left sub-tree of all nodes were less than the value of its root node ( 2) If the right subtree is not empty, then the right sub-tree nodes of all values are greater than the value of its root node (3) left and right subtree, respectively for the binary sort tr
To Search:
File list (Check if you may need any files):
排序二叉树
..........\Debug
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\.....\排序.obj
..........\.....\排序二叉树.exe
..........\.....\排序二叉树.ilk
..........\.....\排序二叉树.pch
..........\.....\排序二叉树.pdb
..........\排序.cpp
..........\排序二叉树.dsp
..........\排序二叉树.dsw
..........\排序二叉树.ncb
..........\排序二叉树.opt
..........\排序二叉树.plg
Download