Tries and patricia tries are two popular data structures for storing strings. Let H-n denote the height of the trie (the patricia trie, respectively) on a set of n strings. Under the uniform distribution model on the strings, it is well known that H-n/logn ->2 for tries and H-n/logn ->1 for patricia tries, when n approaches infinity. Nevertheless, in the worst case, the height of a trie can be unbounded and the height of a patricia trie is in Theta(n). To better understand the practical performance of both tries and patricia tries, we investigate these two classical data structures in a smoothed analysis model. Given a set S = {s(1), s(2), . . . , s(n)} of n binary strings, we perturb the set by adding an i.i.d. Bernoulli random noise to each bit of every string. We show that the resulting smoothed heights of the trie and the patricia trie are both in Theta(logn). (C) 2015 Elsevier B.V. All rights reserved.