insertInOrder(node, child, nodeOrder) {
        const childIndex = nodeOrder.indexOf(child.name);
        if (node.children && childIndex >= 0) {
            for (let i = childIndex + 1; i < nodeOrder.length; i++) {
                const sibling = this.findChild(node, nodeOrder[i]);
                if (sibling) {
                    this.insertBefore(node, child, sibling);
                    return;
                }
            }
        }

        this.appendChild(node, child);
    }
Insert a child node in the correct order.
@param {{}} node - The parent node.
@param {{}} child - The child node.
@param {Array.<string>} nodeOrder - The order of the node names.
@returns {undefined}