Please dont' use struct

create 2 classes node and binarytree

Binary tree not binary search tree

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 ptrLeft, ptrRight, intVar and various functions, etc. Next, create the myBiTree class. Class would contains prtHead, node *ptrHead: , and various functions, etc. // 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) TL.insert(3); T1.insert(11); T1.insert(17): T1.insert(42): cout