Description: 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.
To Search:
File list (Check if you may need any files):
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
Download