Run results for: Built-in Flat vs Custom Recursive Concatenation vs Custom iterative Concatenation

Test name	Executions per second
✓ Recursive	97,297 Ops/sec
Iterative v3	90,741 Ops/sec
Iterative v2	65,705 Ops/sec
Iterative v4	65,402 Ops/sec
Iterative	64,836 Ops/sec
Array.flat().join()	60,243 Ops/sec

Script Preparation code:

/*your preparation JavaScript code goes here
To execute async code during the script preparation, wrap it as function globalMeasureThatScriptPrepareFunction, example:*/
async function globalMeasureThatScriptPrepareFunction() {
    // This function is optional, feel free to remove it.
    // await someThing();
}

function generateRandomTree(depth, maxChildren) {
    if (depth <= 0) {
        return `<span>Data-${Math.random().toFixed(2)}</span>`;
    }

    const childrenCount = Math.floor(Math.random() * maxChildren) + 1;
    const arr = [];

    arr.props = {
        id: Math.random()
    };
    arr.push(`<div>`);

    for (let i = 0; i < childrenCount; i++) {
        if (Math.random() > 0.2) {
            arr.push(generateRandomTree(depth - 1, maxChildren));
        } else {
            arr.push("text-node");
        }
    }

    arr.push(`</div>`);

    return arr;
}

// Method A: Built-in Flat
function renderFlat(tree) {
    return tree.flat(Infinity).join('');
}

// Method B: Custom Recursive Concatenation
function renderRecursive(node) {
    if (typeof node === 'string') return node;
    if (Array.isArray(node)) {
        let str = '';
        const len = node.length;
        for (let i = 0; i < len; i++) {
            str += renderRecursive(node[i]);
        }
        return str;
    }
    return '';
}

// Method C: Custom iterative Concatenation
function renderIterative(tree) {
    let html = '';
    const stack = [tree];
    while (stack.length) {
        const node = stack.pop();
        if (typeof node === 'string') {
            html += node;
            continue;
        }

        if (Array.isArray(node)) {
            for (let i = node.length - 1; i >= 0; i--) {
                stack.push(node[i]);
            }
            continue;
        }
    }

    return html;
}

// Method C: Custom iterative Concatenation
function renderIterativeV2(tree) {
    let html = '';
    const stack = [tree];
    while (stack.length) {
        const node = stack.pop();
        if (Array.isArray(node)) {
            for (let i = node.length - 1; i >= 0; i--) {
                stack.push(node[i]);
            }
            continue;
        }

        html += node;

    }

    return html;
}

function renderIterativeV3(tree) {
    let html = '';
    const stack = [tree];
    let stackIndex = 0;

    while (stackIndex >= 0) {
        const node = stack[stackIndex];

        stackIndex--;

        if (typeof node === 'string') {
            html += node;
            continue;
        }

        if (Array.isArray(node)) {
            // Push children manually
            for (let i = node.length - 1; i >= 0; i--) {
                stackIndex++;
                stack[stackIndex] = node[i];
            }
            continue;
        }

        if (typeof node === 'number') {
            html += node;
        }
    }

    return html;
}

function renderIterativeV4(tree) {
    let html = '';
    const stack = [tree];
    while (stack.length) {
        const node = stack.pop();
        if (typeof node === 'string') {
            html += node;
            continue;
        }

        for (let i = node.length - 1; i >= 0; i--) {
            stack.push(node[i]);
        }
    }

    return html;
}

const array = generateRandomTree(5, 10)

Run results for: Built-in Flat vs Custom Recursive Concatenation vs Custom iterative Concatenation

Array.flat().join()

Recursive

Iterative

Iterative v2

Iterative v3

Iterative v4