An IndexTree represents the decided order in which operations should be applied.
Because the underlying data structure is a BTree, we can conveniently add
Op by their provided indices.
Note that unified Op could be given any index of the values they were originally unified
from.