In C++ develop an algorithm that inserts the value val into a binary search tree with root. If the tree is empty, root = null. The algorithm returns the root of the tree containing the added item. You should assume that new node creates a new node with data field data and reference fields left (for left child) and right (for right child).