is there implementation for b_tree indexing in file structure and organization in c++?

Question

For Example, Consider the following Insertions: Insert: 3, 12
Insert: 7, 24 Insert: 10, 48 Insert: 24, 60 Insert: 14, 72

The index file should look as follow: -1 2