AVL树研究与实现  

Research and Implementation of AVL Tree

作　　者：解晨[1] XIE Chen（Zhongshan University,Guangzhou 510275,China）

机构地区：[1]中山大学,广东广州510275

出　　处：《电脑知识与技术》2013年第3期1532-1536,共5页Computer Knowledge and Technology

摘　　要：计算机最广为人知的优点之一是其能储存大量的数据,如今随着时代的发展,储存容量更是犹如日进千里一般极速扩展,大容量的硬盘、U盘早已随处可见。然而,要在巨大的数据中搜索出需要的内容却不是一件容易的事,由此,为了能减少在搜索储存数据上的开销,各种适应于不同访问搜索背景的数据结构应运而生。树,便是计算机学科中最基本的数据结构之一,提供了快速的储存和访问性能。该文探究了带有平衡条件的二叉查找树——AVL树的原理,并对其使用C语言进行了实现。One of the most well known is the advantages of computer can store large amounts of data,and now with the develop ment of the times,the storage capacity is more like Japan into thousands of general extended,hard disk,U disk has large capacity can be seen everywhere.However,to search for in the huge data in the needs of the content is not a easy thing,therefore,in or der to reduce the data storage overhead in the search,all kinds of adaptation to different access search emerge as the times require data structure background.Tree,is one of the most basic data structure in computer science,provides fast storage and access per formance.This paper explores the two binary search tree with equilibrium conditions--principle of AVL tree,and the use of C language to realize.

关 键 词：数据结构 平衡二叉查找树 AVL树 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]