What is the name of the data structure that combines fast insertion of elements and sequential data processing, based on the use of segments or leaves?

This type of data structure is called a Segmented Linked List or sometimes a Chunked List. It combines the advantages of fast insertion of elements (like in a linked list) and efficient sequential data processing by storing elements in segments (or blocks) that are linked together.

In Java, a similar approach is used, for example, in some implementations of queues or buffers, where data is divided into blocks to optimize insertion and traversal operations.

An example of a simplified concept in Java:

class Segment {
    int[] elements;
    int count;
    Segment next;

    Segment(int size) {
        elements = new int[size];
        count = 0;
        next = null;
    }
}

class SegmentedList {
    Segment head;
    Segment tail;
    int segmentSize;

    SegmentedList(int segmentSize) {
        this.segmentSize = segmentSize;
        head = tail = new Segment(segmentSize);
    }

    void add(int value) {
        if (tail.count == segmentSize) {
            tail.next = new Segment(segmentSize);
            tail = tail.next;
        }
        tail.elements[tail.count++] = value;
    }
}