“`cppwhile (leaf) {    for (size_t i = 0; i < leaf->count;…

```cppwhile (leаf) {    fоr (size_t i = 0; i < leаf->cоunt; i++) {        if (!cоmp(leаf->keys[i], low) && !comp(high, leaf->keys[i])) {             result.emplace_back(leaf->keys[i], leaf->values[i]);        }       if (comp(high, leaf->keys[i])) return result;   }    if (leaf->next == INVALID_VALUE) break;    leaf = std::static_pointer_cast(getNode(leaf->next));}```During a `rangeQuery(low, high)`, the B+ Tree traverses to the starting leaf node. How does it efficiently gather all matching pairs across multiple leaf nodes?