5.1 Representation

The represention of an AVL tree is similar to that of a plain binary search tree. However, the height needs to be represented explicitly as a data member h. Note that this data member should be a part of struct _Tree, not a part of struct _Node.