Using a B Plus Tree to Store the Data Values

In a b plus tree structureo, the only the leaves of the tree actually store the data values. All of the root and interior e nodes will always store only the keys. If you're using a b plus three only as an index, then the value that you get back is just gongto be a pointer to the data that lives somewhere else. I think i'm gadenowhagain and there's the alternative where you actually use the b plus tree to store the primary data as well.