AVL Trees Balanced Binary Tree %O(log n)% Lookup, %O(1)% Insertion and Removal Better for data storage "Regular" Binary Trees %O(n)% Lookup, %O(1)% Insertion and Removal Simpler, Slower Better for data modeling