Description: 1. write AVL tree discrimination program, and determines whether a binary search tree is an AVL tree 2. implement basic operations on it is: Search, Insert, Delete, and Ascend 3. Basic operations dynamic presentations 4. extended A. achieve indexed AVL search tree, the basic operations on it: Search, Insert, Delete, IndexSearch, IndexDelete, Ascend
To Search:
File list (Check if you may need any files):
IAVL4.a
.......\BSTree.h
.......\Debug
.......\.....\IAVL.exe
.......\.....\IAVL.ilk
.......\.....\IAVL.pch
.......\.....\IAVL.pdb
.......\.....\main2.obj
.......\.....\vc60.idb
.......\.....\vc60.pdb
.......\IAVL.dsp
.......\IAVL.dsw
.......\IAVL.ncb
.......\IAVL.opt
.......\IAVL.plg
.......\IAVLshow.cpp
.......\avlnode2.h
.......\iavl.cpp
.......\iavl.h
.......\main2.cpp
.......\queue.h
.......\stack.h
.......\xcept.h
Download