Fringe analysis is a technique used to study the average behavior of s
earch trees. In this paper we survey the main results regarding this t
echnique, and we improve a previous asymptotic theorem. At the same ti
me, we present new developments and applications of the theory that al
low improvements in several bounds on the behavior of search trees. Ou
r examples cover binary search trees, AVL-trees, 2-3 trees, and B-tree
s.