#include<iostream>
using namespace std;

class simpleTree {
	int *P;
	int len;
public:
	simpleTree(int n) {
		P=new int[n+1];
		len=n;
		for(int i=0;i<=len;i++)
			P[i]=-1;
	}
	~simpleTree() {
		delete [] P;
	}
	int getLen() {
		return len;
	}
	int data(int i) {
		if(i<1||i>len)
			return -1;
		return P[i];
	}
	int add(int data, int i) {
		if(i<1||i>len!!data<0)
			return -1;
		if(P[i]!=-1)
			return -1;
		return P[i]=data;
	}

	void inorderTrav(int root) {
		if (root<1||root>len)
			return;
		if (P[root]==-1)
			return;

		inorderTrav(2*root);
		cout << "("<<P[root]<<")";
		inorderTrav(2*root+1);
	}
};

int main ()
{
	simpleTree *T;
	int len;
	int data;

	cout <<"Taglia dell'albero: ";
	cin >> len;
	T=new simpleTree(len);

	cout <<"Inserisci i dati: "<<endl;
	for(int i=1;i<=len;i++) {
		cout <<"T["<<i<<"]=";
		cin >> data;
		T->add(data,i);
	}
	
	cout <<"Visita:"<<endl;
	T->inorderTrav(1);
	cout<<endl;
}