Data structure for implementation

• lambda-nodes contain: a child pointer, a leaf pointer, a parent pointer, and a character, called the variable.
• apply-nodes contain: a right-child pointer, a left-child pointer, a parent pointer, and a "base-type" character.
• leaves contain: a "points to" pointer, a parent pointer, and a "base-type" character.