#include <stdio.h>
typedef struct List{
int data;
struct List *next;
} L;
void insert(L *head,L* node,int position){
L* p = head;
int i=0;
while(i<position){
i++;
p=p->next;
}
node->next=p->next;
p->next=node;
}
#include <stdio.h>
typedef struct Tree{
int data;
struct Tree *leftChild;
struct Tree *rightChild;
} T;
void traversalTree(T* tree){
if(tree==null){
return;
}
printf("%d\t",tree->data);
traversalTree(tree->leftChild);
traversalTree(tree->rightChild);
}