Lower Bound Analysis
In the tree we put the indices of the elements being compared.
Key rearrangements are assumed, but not explicitly shown.
Although a comparison is an opportunity for divergent behavior, the algorithm does not need to take advantage of this opportunity.