 When a new entry is needed, the counter steps through the dictionary until a leaf node is found (a node with no dependents).This is deleted and the space re-used for the new entry.This is simpler to implement than LRU or LFU and achieves equivalent performance.