Before revision: We show how an Euler tour for a tree on n vertices with maximum degree d can be stored in 2 n + o (n) bits such that queries take O (\log n) time and updates take O (d \log^{1 + \epsilon time.
After revision: We show how a collection of Euler-tour trees for a forest on n vertices with maximum degree d can be stored in 2 n + o (n) bits such that queries take O (\log n) time and updates take O (d \log^{1 + \epsilon time.