Let $m\ge 3$ be an integer. The so-called$m$-ary search treeis a discrete time Markov chain which is very popular in theoretical computer science, modelling famous algorithms used in searching and sorting. This random process satisfies a well-known phase transition: when $m\le 26$, the asymptotic behavior of the process is Gaussian, but for $m\ge 27$ it is no longer Gaussian and a limit $W^{DT}$ of a complex-valued martingale arises. In this paper, we consider the multitype branching process which is the continuous time version...