Write code in C/C++ to insert/search for a record in BTree.
Sigiloso
Starting from the root, compare key, if smaller, move to child on the left, if greater move to child on right. Repeat this until desired value found (search) or until no children found where child can be inserted (insert).