Description: Input from the keyboard on a string of positive integers, the last input-1 as an input symbol of the end. Such as input sequence as follows: 2,5,7,23,48,96, ... ...,-1. Please refer to these as a positive integer value of two binary sort tree nodes in the data field' s value, set up a binary sort tree. Note: please use the dynamic storage method to preserve tree binary sort tree, the prior did not know that the binary sort tree in the number of nodes.
File list (Check if you may need any files):
动态存储方法保存二叉排序树
..........................\Debug
..........................\.....\stack.obj
..........................\.....\vc60.idb
..........................\.....\vc60.pdb
..........................\.....\zuoye2.exe
..........................\.....\zuoye2.ilk
..........................\.....\zuoye2.pch
..........................\.....\zuoye2.pdb
..........................\stack.cpp
..........................\zuoye2.dsp
..........................\zuoye2.dsw
..........................\zuoye2.ncb
..........................\zuoye2.opt
..........................\zuoye2.plg
Download