二叉树的创建（The creation of two fork tree）.docVIP

二叉树的创建（The creation of two fork tree） The two fork tree to create.Txt I degradation, I still cant swim, to know before I was born, I was definitely the topic the fastest swimming, two: to establish a binary sort tree insert, delete and search Completion date: 2010-7- First, demand analysis 1, operating environment: VC++6.0 language: C language; Procedures to achieve the functions: given a set of key values, the establishment of two binary sort tree corresponding to the finish: Delete 1 nodes, insert a new node operation 2 of the value given to search in the two binary sort tree; 3 ready to show the result of the operation. 2, the input of the program: n keyword, and you want to insert, delete, search keywords; 3, the program output sequence: two binary sort tree operation after the increasing sequence; 4, test data: 1) 812510611139 (n=8); 10; 7; 11; 2) 1071298 (n=5); 10; 6; 10; 3) 856 (n=3); 6; 9; 8; Two, outline design The main program flow chart, 1: 2, the main module: 1) the main function module (Main) { Two binary sort tree to establish n keyword and output; Delete any node from the two binary sort tree T tree, whose key is x; In the two binary tree sort tree T, insert a node T, whose key is key1; In the two binary sort tree T recursive search keyword is equal to the data elements of key2; Find the success of the output of SUCCESS; The failure to find the output NOSUCCESS; } 2) create two binary sort tree module BiTree CreatBST (int n) { Two binary sort tree to establish n keyword; The establishment of adjustable n keyword followed by the InsertBST1 input from the keyboard (insert function); Returns the root node of T; The output of the process; } 3) delete module DeleteNode (BiTree T, int x) { Delete any node from the two binary sort tree T tree, whose key is x; You can delete the root node and leaf node and any other node function; } 4) insert module Void InsertBST1 (BiTree T, BiTNode *s) { In the two binary tree sort tree T, insert a node s (recursive algorit