I am trying to complete an insertion function for my binary tree, but i am a little confused, because it uses two classes. Here is the code:

Code:class CBinTreeNode { public: CBinTreeNode() : left(0), right(0), parent(0) {} CBinTreeNode(int k) : left(0), right(0), parent(0) {key = k;} CBinTreeNode *left; CBinTreeNode *right; CBinTreeNode *parent; int key; }; class CBinTree { public: CBinTree() {root = NULL;} void Insert(CBinTreeNode *z, int &c) { // TO DO } CBinTreeNode *root; };All the above code was provided, so i need to do the Insert function (where it says "TO DO"). The pseudocode for this is:Code:int main(int argc, char* argv[]) { // declare logistical variables (for testing) const size_t sa = 10001; int sizes[] = {1,2,3,4,5,6,7,8,9,10,20,30,40,70,100,200,300,500,1000,2000,5000,10000}; int s_sizes = 22; int a[sa]; // This is always the input to work with srand((unsigned int)time((time_t)0)); // Demonstrate binary tree cout << endl<< "Demonstrate binary search tree:" << endl; int ts = 10; InitA(a, ts, 100); // generate small random array Print(a, ts); // display array // insert each element onto stack CBinTree tree; c=0; cout << endl<< "Insert:" << endl; for (int i=0; i < ts; i++) { tree.Insert(new CBinTreeNode(a[i]), c); } return 0; }

I'm trying to figure out how to make the pseudocode work for my insert function, but i'm a little confused because this program uses two classes for the tree, and i'm not that great with using classes.Code:Tree-Insert(T,z) y<- NIL x<-root[T]whilex (does not equal) NIL do y<- x if key[z]<key[x] then x<-left[x] else x<-right[x] p[z]<-y if y = NIL then root[T]<-z else if key[z]<key[y] then left[y]<-z else right[y]<-z

So, in the pseudocode insert function, the tree(T) is a parameter, but i don't have it as a parameter in my function. I can't figure out how to create x and assign it the root of the tree. If i can get that, i might be able to continue with the psuedocode.

NOTE* - None of the code should be modified, except for the insert function's body. The parameter c in the function is just a counter.

Any help would be appreciated.

Thanks.