Dictionary AST implemented as an Iterative AVL tree
This contianer functions as a replacement for std::map, where std::map is a RedBlack Tree, this uses an AVL tree. It supports inserting items, deleting items, retrieving items, set membership, and in-order traversal through iterators. It can also return an array of they keys in sorted order.