《数据结构》中基于二叉排序树的查找与排序算法讲解  

Explanation of Search and Sorting Algorithm Based on Binary Sort Tree in Data Structure

作　　者：吐尔地·托合提[1] Turdi Tohti(College of Information Science and Engineering,Xinjiang University,Urumqi 830046)

机构地区：[1]新疆大学信息科学与工程学院,乌鲁木齐830046

出　　处：《现代计算机》2021年第13期117-120,共4页Modern Computer

摘　　要：本文选二叉排序树为数据表示方法,对其基本结点结构和生成方法进行相应的改进,在它已有的高效查找特性的基础上,再引入基于二叉树遍历的排序方法。通过讲解一套基于二叉链表的数据存储、查找和排序算法,一方面,加深学生对链式存储结构、二叉树及二叉链表的性质的理解,以及遍历算法应用的掌握程度,另一方面,培养学生以数据为中心的分析问题、解决问题的技能。In this paper,binary sort tree is selected as the data representation method,and its basic node structure and structural generation method are improved accordingly.On the basis of its existing efficient search efficiency,a sorting method based on binary tree traverse is introduced.By explaining a set of data storage,search and sorting algorithm based on binary linked list,on the one hand,it deepens students’understanding of the linked storage structure,the properties of binary tree and binary linked list,as well as their mastery of traversal algorithm application.On the other hand,it cultivates students’skills of analyzing and solving problems with data as the center.

关 键 词：二叉树 二叉排序树 二叉链表 查找 排序 

分 类 号：G642[文化科学—高等教育学] TP311.12-4[文化科学—教育学]