Résumé : The Delaunay Tree is a hierarchical data structure that has been introduced in \cite{BT} and analyzed in \cite{deltree,idag}. For a given set of sites S in the plane and an order of insertion for these sites, the Delaunay Tree stores all the successive Delaunay triangulations. As proved before, the Delaunay Tree allows the insertion of a site in logarithmic expected time and linear expected space, when the insertion sequence is randomized. In this paper, we describe an algorithm maintaining the Delaunay Tree under insertions and deletions of sites. This can be done in O(log n) expected time for an insertion and O(loglog n) expected time for a deletion, where n is the number of sites currently present in the strucuture. For deletions, by expected time, we mean averaging over all already inserted sites for the choice of the deleted sites. The algorithm has been effectively coded and experimental results are given.