Alright, so then, this begs the question.

但这似乎并不是问题的实质。

哈佛公开课 - 计算机科学课程节选

So if on each iteration of merging I'm doing eight things or more generally, N. That then begs the question, how many levels of this tree are there actually?

可见对于合并我需要迭代8次,一般情况下是N，这取决于具体问题，那么在这棵树中一共有多少层呢？

哈佛公开课 - 计算机科学课程节选