AVL Tree Implementation

Description

My own Templatized C++ Implementation of AVL Tree and its Different Traversals i.e, PreOrder, PostOrder, InOrder using Microsoft Visual Studio. You can also check the Type of Binary Search Tree as well i.e, full binary tree, perfect binary tree etc.

Functions

• getRoot()
• insert()
• retrieve()
• isEmpty()
• getHeight()
• remove()
• inOrderDisplay()
• preOrderDisplay()
• postOrderDisplay()
• FullBinaryTree()
• PerfectBinaryTree()
• CompleteBinaryTree()
• BalancedBinaryTree()
• DegenerateTree()