this is a recursive preorder traversal

createtree(ptree)

/* Read the data and create the binary tree tree. */

binarytreepointer *ptree;

{

binarytreepointer l,r,setnull(),left(),right();

if (*ptree != setnull())

{

createnode(ptree);

l = left(*ptree);

createtree(&l);

r = right(*ptree);

createtree(&r);

}

}