Trees 2

#include <iostream>
using namespace std;
struct node{
-int data;
-node *p1, *p2;
-node(int i){
--data = i;
-}
-void print(){
--cout<<data<<endl;
-}
};
int main(){
-node *root = new node(8);
-root->p1 = new node(10);
-root->p2 = new node(20);
-root->p1->p1 = new node(30);
-root->p1->p2 = new node(40);
-cout<<"\t\t\t"<<root->data<<endl;
-cout<<"\t"<<root->p1->data;
-cout<<"\t\t\t\t"<<root->p2->data<<endl;
-cout<<root->p1->p1->data<<"\t\t";
-cout<<root->p1->p2->data<<endl;
}