平衡二叉树的五步失衡调整方法探索  

A five-step imbalance adjustment method of balanced binary tree

作　　者：刘慧 张兆维 Liu hui;Zhang Zhaowei(Jinling Institute of Technology,school of software engineering,Nanjing,Jiangsu 211169,China;Nanjing University of Posts and Telecommunications,school of Iot Engineering)

机构地区：[1]金陵科技学院软件工程学院,江苏南京211169 [2]南京邮电大学物联网学院

出　　处：《计算机时代》2020年第11期78-81,共4页Computer Era

基　　金：金陵科技学院高层次人才工作启动费资助项目(jit-b-202006)。

摘　　要：平衡二叉树的失衡调整不仅是数据结构课程的一个重要理论知识点,在软件开发过程中也有广泛的实际应用。旋转是对平衡二叉树进行失衡调整的主要手段,然而传统的左右旋转方法存在着操作繁琐、处理分散、不易被学生理解的问题。对此,文章提出一种五步失衡调整方法,该方法通过对四种旋转类型进行统一处理,简化了处理流程,从而降低了学生的理解难度。实际的教学结果验证了该方法的教学效果。The imbalance adjustment of the balanced binary tree is not only an important theoretical knowledge point of data structure course,but also has a wide range of practical applications in the development of software.Rotation is the main means to adjust the imbalance of balanced binary tree.However,the traditional left-right rotation method has the problems of cumbersome operation,scattered processing and difficult to be understood by students.Therefore this paper proposes a five step imbalance adjustment method,which simplifies the process by unifying the processing of four types of rotation,so as to reduce the difficulty of students'understanding.The actual teaching results verify the teaching effect of this method.

关 键 词：数据结构 平衡二叉树 失衡调整 平衡因子 五步失衡调整 

分 类 号：G642[文化科学—高等教育学]