Description: List for storage with the two fork structures (a) to carriage return ( ' \ n' ) for the input end of the symbol, enter the number of columns L, respectively, generating a binary sort tree T and balanced binary sort tree BT (2) right two binary sort tree T in order to make traversal, the output results (3) input element x, to find two binary sort tree T: if there exists node containing x, then delete the node, and for medium-order traversal (to perform operations 2 ) otherwise, the output-related information (4) were calculated T, BT Find the average successful search length, the output results
File list (Check if you may need any files):
平衡二叉树\avl.c
..........\BT1.c
..........\BT2.c
..........\BT3.C
..........\BT4.C
..........\BT5.C
..........\BT6.C
..........\BT7.C
..........\BT8.C
..........\复件 BT7.C
..........\复件BT~1.C
..........\平衡二叉树.C
..........\平衡二叉树.doc
..........\平衡二叉树.EXE
..........\排序.doc
..........\测试必读.txt
平衡二叉树
Download