I am finding the recursion depth or the level of the best case for the quick sort algorithm.

Reference book, Google and all other resources all giving me the answer that recursion depth of the best case for quick sort algorithm is log n. However ,drawing the recursion tree out, the recursion depth supposed to be log n + 1 from the top to the base case. So, why is log n.