Description: Data structures course experiment. Construct a binary search tree, balanced binary tree structure- achieved with the AVL tree, the tree can be compared in two leveling process, there are insert node, delete a node, level, indent printing trees and other functions.
To Search:
File list (Check if you may need any files):
AVLTree2\AVLTree.cpp
........\AVLTree.h
........\AVLTree2.cbp
........\AVLTree2.depend
........\AVLTree2.layout
........\bin\Debug\AVLTree2.exe
........\BST.cpp
........\BST.h
........\main.cpp
........\obj\Debug\AVLTree.o
........\...\.....\BST.o
........\...\.....\main.o
........\...\.....\src
........\bin\Debug
........\obj\Debug
........\bin
........\obj
AVLTree2
Download