Description: Classic examples of data structures, to establish binary sort tree. Keyboard input from a string of positive integers, the last input-1 as the input end of the sign. If the input sequence: 2,5,7,23,48,96, ... ...,-1. Please these are integer values as binary sort tree nodes of the value data field, the establishment of a binary sort tree.
To Search:
File list (Check if you may need any files):
实习题\5070309538_3.dsp
......\5070309538_3.dsw
......\5070309538_3.ncb
......\5070309538_3.opt
......\5070309538_3.plg
......\BST.h
......\main.cpp
实习题
Download