In this paper we describe a fast algorithm that creates a wavelet tree for a sequence of symbols. We show that a wavelet tree can be constructed in O(n [log sigma/root logn]) time where n is the number of symbols and a is the alphabet size. (C) 2015 Elsevier B.V. All rights reserved.