mavlnode.hpp

AVL Tree implementation: I also included a test function to compare the AVL Tree performance with S

#ifndef _AVLTREENODE_
#define _AVLTREENODE_

// The Tree Node Struct
template<class T>
struct AVLNode
{
	T item;
	AVLNode<T>* parent;
	AVLNode<T>* left;
	AVLNode<T>* right;
	bool isHeader;
	char balanceFactor;
	char visitFlag; //'V' for visited only, 'E' for end of node, 'N' for not visited yet
};

#endif