DESCRIPTION

This is an example metclass in which all attributes are created lazily. This means that no entries are made in the instance HASH until the last possible moment.

The example above of a binary tree is a good use for such a metaclass because it allows the class to be space efficient without complicating the programing of it. This would also be ideal for a class which has a large amount of attributes, several of which are optional.