文件名称:AVL_tree
介绍说明－－下载内容均来自于网络，请自行研究使用
在计算机科学中，AVL树是最先发明的自平衡二叉查找树。AVL树得名于它的发明者 G.M. Adelson-Velsky 和 E.M. Landis，他们在 1962 年的论文 "An algorithm for the organization of information" 中发表了它。
-In computer science, AVL tree is a self-balancing binary search tree first invented. AVL tree is named after its inventor GM Adelson-Velsky and EM Landis, they published a paper in 1962 that it " An algorithm for the organization of information" in.
-In computer science, AVL tree is a self-balancing binary search tree first invented. AVL tree is named after its inventor GM Adelson-Velsky and EM Landis, they published a paper in 1962 that it " An algorithm for the organization of information" in.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Binary_tree.h
Main.cpp
MyStack.cpp
MyStack.h
Record.cpp
Record.h
Search_tree.cpp
Search_tree.h
AVL_node.cpp
AVL_node.h
AVL_tree.cpp
AVL_tree.h
Binary_node.cpp
Binary_node.h
Binary_tree.cpp