Description: AVL balanced tree is a very efficient binary search tree, it can use the rotation function can be constructed easily, quickly find
To Search:
File list (Check if you may need any files):
AVl_Tree
........\AVl_Tree.dsp
........\AVl_Tree.dsw
........\AVl_Tree.ncb
........\AVl_Tree.opt
........\AVl_Tree.plg
........\avl_tree_class.h
........\Debug
........\.....\AVl_Tree.exe
........\.....\AVl_Tree.ilk
........\.....\AVl_Tree.pch
........\.....\AVl_Tree.pdb
........\.....\test_avl.exe
........\.....\test_avl.ilk
........\.....\test_avl.obj
........\.....\test_avl.pch
........\.....\test_avl.pdb
........\.....\vc60.idb
........\.....\vc60.pdb
........\Queue_class.h
........\Stack_class.h
........\test_avl.cpp
........\test_avl.dsp
........\test_avl.dsw
........\test_avl.ncb
........\test_avl.opt
........\test_avl.plg
Download