C++ code

Program 2 Implement a Binary tree using pointers, Store integers. Call your class myBiTree. (5 points) * First, create an itemode/element class. Class would contain ptrteft, ptrRight, intVar and various functions, etc. Next, create the myBiTree class. Class would contains prtHead, node.pt Head, and various functions, etc. 1 Comment your code well., explaining how each function works *** Use the following to test... int main() { myBiTree T1: T1.insert(15) T1.insert(9); T1.insert(21) T1.insert(3): T1.insert(11) T1.insert(17) T1.insert(42) cout