76
// All trees have same height, just create parent nodes.
77
while (length > 3) {
79
>
for (let i = 0; i < newLength; i++) {
80
>
const j = i << 1;
81
>
items[i] = ListAstNode.create23(items[j], items[j + 1], j + 3 === length ? items[j + 2] : null, createImmutableLists);
82
>
}
83
>
length = newLength;
84
>
}
85
return ListAstNode.create23(items[0], items[1], length >= 3 ? items[2] : null, createImmutableLists);
86
}