Skip lists have been shown to be Expected O(log n) in the probabilistic case, and O(log n) in the deterministic. In this paper we prove that they are also O(log n) in the amortized case.