You are on page 1of 1

typedef struct BinaryTree{

ITEMTYPE data;
struct BinaryTree *left;
struct BinaryTree *right;
} BINARYTREE;

BINARYTREE* createNode(ITEMTYPE item){


BINARYTREE * t;
t = (BINARYTREE*)malloc (sizeof(BINARYTREE));
t->data = item;
t->left = NULL;
t->right = NULL;
return t;
}
main(){
BINARYTREE *n1,*n2,*n3,*n4;
n1 = createNode(a);
n2 = createNode(b);
n3 = createNode(c);
n4 = createNode(d);
n1->left = n2;
n1->right = n3;
n2->right = n4;
}

You might also like