Answer
\begin{array}{l}{\text { If the original list has n elements, the mergeSort tree will have log } n \text { elements. }} \\ {\text { Because the list can be divided into two lists of } n / 2, \text { and then } 4 \text { lists of } n / 4} \\ {\text { and so on, we have } 2^{\log n}=n \text { lists of size } \frac{n}{2^{\log n}}=1 \text { element. }}\end{array}
Work Step by Step
--
