二叉排序树与平衡二叉排序树基本操作的实现 文本文档（Two fork sorting tree and balance two fork sort tree basic operation of the realization of text documents）.doc

二叉排序树与平衡二叉排序树基本操作的实现 文本文档（Two fork sorting tree and balance two fork sort tree basic operation of the realization of text documents） Course design task book for undergraduate students of Panzhihua University Title two fork sorting tree and the realization of balanced two fork tree 1, the purpose of curriculum design It can help students further understand and master the logical structure, storage structure and operation implementation algorithms of various abstract data types in the classroom, as well as how they are used in programs. Make students master the basic content and design methods of software design, and cultivate students ability to standardize software design. 3) enable students to master the use of various computer materials and reference materials, improve the basic ability of students to program design. 2, the content and requirements of curriculum design (including raw data, technical requirements, job requirements, etc.) (1) (1) take the carriage return (\n) as the input end flag, enter the sequence L, and generate a two fork sorting tree T; (2) do the inorder traversal of the two fork sort tree T, and output the result; (3) calculate the two fork sort tree T find the average search length of success, the output results; (4) input element x, find the two fork sorting tree T, if there is a node containing x, then delete the node, and make the order traversal (execution operation 2); otherwise the output information NO x; (5) with the sequence of L, the two generation balanced binary sort tree BT: when inserting new elements, found that two of the current two binary sort tree binary sort tree BT is not balanced, then two binary sort tree it into a new balance BT; (6) calculate the average lookup length of the balanced two fork sorting tree BT, and output the result. 3. Main references 1 Liu Dayou, data structure (C language version), higher education press [2] Yan Yumin et al., data structure (C Language Edition), Tsinghua University press [3] Willia