Help with Tree/Objects

[chinmoyk]

Hello, I need to fetch all the elements of the tree.

Tree is such that        0
                     1       2
                   3   4   5    6
and so on.

My fetch function goes on deepest towards left while collecting roots..then the right. However, I am facing a problem with cloning of objects. I am not even sure that is the right approach.

I have commented out my final fetch function. and I am trying it on a simple example(I have marked below)
Could you please suggest if the approach is right. If yes, how do I get past it?

#include<iostream>
#include<cstdio>
#include<cstdlib>
using namespace std;

class node
{
    public:   
        node* left;
        node* right;
        node* parent;
	int data;

	void insertl(node* lnode)
	{
	this->left=lnode;
	}
	void insertr(node* rnode)
	{
	this->right=rnode;
	}
	void ap(node* pnode)
	{
	this->parent = pnode;
	}
	void printdata()
	{
	cout<<"Self : "<<this<<"\n";
	cout<<"Data : "<<this->data<<"\n";
	cout<<"Left : "<<this->left<<"\n";
	cout<<"Right : "<<this->right<<"\n";
	cout<<"Parent : "<<this->parent<<"\n";
	}
	
};
/* 
void fetch(node root1)
{
    node root;
    node curr_node;
    root=root1;
    int done=0;
    int  d;
    int xx[1000000];
    int xx_ind =0;
    int x[1000000];
    while(not done)
	{
        if (root.data)
	{
            curr_node = root;
	    root = root.left;
            if (root.data)
	    {
                d = root.data;
                xx[xx_ind] = d;
                xx_ind = xx_ind + 1;
                cout<<d;
            }
	}
        else
	{
            root = curr_node.parent;
            if (root.data)
	    {
                curr_node = root;
                root=root.right;
                if (root.data)
		{
                    d = root.data;
                    xx[xx_ind] = d;
                    xx_ind = xx_ind + 1;
                    cout<<d;
		}
	    }
            else
	    {
                done=1;
	    }	
	 }
	}
}
*/

int main()
{
	int num=10; //No. of nodes
	node t[num];
// Making of tree
	for (int i=0;i<num;i++)
	{
	t[i].data=i;
	}
	
	for (int i=0;i<num;i++)
	{
	if((2*i)+1 < num)
		{
		t[i].insertl(&t[(2*i)+1]);
		t[(2*i)+1].ap(&t[i]);
		}
	else
		{
		t[i].insertl(NULL);
		t[(2*i)+1].ap(&t[i]);

		}
	
	if((2*i)+2 < num)
		{
		t[i].insertr(&(t[(2*i)+2]));
		t[(2*i)+1].ap(&t[i]);

		}
	else
		{
		t[i].insertr(NULL);
		t[(2*i)+1].ap(&t[i]);
		}
	}

t[0].printdata();
t[1].printdata();
cout<<"t[0] data : "<<t[0].data;	

t[0]=t[0].left;   //// <<<<<<<------- This particular statement
t[0].printdata();

//cout<<&t[1];
//cout<<"left::"<<&(t[0].left);
//t[0]=&(t[0].left);
//t[0].printdata();

//fetch(0);

for(int i=0;i<num;i++)
{
t[i].printdata();
}

return 0;
}

Thank you, so much!!
Cheers