The height of the node: 1 plus the height of the greater height child of the node. Nodes without children have a height of 1.
The left child of the node.
The right child of the node.
The size of the node: the amount of nodes (including this node itself) within the node's subtree.
This is the class implementation of the AVL tree nodes.