This document provides an overview of AA Trees, which are a simplified version of Red-Black trees. AA Trees achieve simplicity through replacing traditional balancing methods with skew and split operations and representing balance as a single bit per node. Properties of AA Trees are explained in terms of both Red-Black trees and pseudo-nodes, which abstract the tree as having multi-way rather than binary nodes. The skew and split balancing operations are then described, with skew removing left horizontal links and split removing consecutive right links while increasing a node's level.