We characterize the limiting behavior of the number of nodes in level k of binary search trees Tn in the central region 1.2logn.2.8logn. Especially we show that the width .Vn (the maximal number of internal nodes at the same level) satisfies .Vn.(n/.4.logn) as n.. a.s.