B-tree(of minimum degree of t) implementation on OOP(C++, java or python) -- 2

Requirements are functions to :
1-insert(including the splitting and placing it in the right place).
2-traverse.
3-search for a key (also it should give the number of keys in the node I searched for and how much comparisons it made before finding the key).

the program should output:
1- the degree of a tree
2- height of the tree
3- The total number of keys in the node having search key
4- The CPU time to search should be printed (degree * height)
5- Total number of iteration to search the key