Tree buffers contain (type, start, end, endIndex) quads for each node. In such a buffer, nodes are stored in prefix order (parents before children, with the endIndex of the parent indicating which children belong to it).
The buffer's content.
The total length of the group of nodes in the buffer.
The node set used in this buffer.