Protected nodes are neither leaves nor parents of any leaves in a rooted tree. We study here protected node profile, namely, the number of protected nodes with the same distance from the root in digital search trees, some fundamental data structures to store 0 - 1 strings. When each string is a sequence of independent and identically distributed Bernoulli(