Description: 7, binary sort tree balanced description of the problem: Create a balanced binary tree sort of basic requirements: 1, the number of input data shall not be less than 15 2, the establishment of balanced binary sort tree (requirements include the type of LR-type RR LL RL-type four-type kinds of adjustment method) 3, to complete any of the data to find (look for the number of times required to give)
To Search:
File list (Check if you may need any files):
Binary_balance_sorttree\Binary_balance_sorttree.dsp
.......................\Binary_balance_sorttree.dsw
.......................\Binary_balance_sorttree.ncb
.......................\Binary_balance_sorttree.plg
.......................\main_sorttree.cpp
.......................\binarytree.h
.......................\Binary_balance_sorttree.opt
.......................\Debug\Binary_balance_sorttree.exe
.......................\.....\Binary_balance_sorttree.pdb
.......................\.....\vc60.idb
.......................\.....\vc60.pdb
.......................\.....\Binary_balance_sorttree.pch
.......................\.....\main_sorttree.obj
.......................\.....\Binary_balance_sorttree.ilk
.......................\Debug
Binary_balance_sorttree
Download