🚀 go-pugleaf

// I am trying to write a function that copies a binary tree without just
setting a pointer
// equal to the root pointer.  This is some of what I have.  Everything
works except the
// copyTree function.
// I figure using recursion would be easer, but if there is another way
can someone
// please show me the way.

typedef struct Node{
	int num;
	struct Node *left, *right;
} node;

typedef node *np;

np *search(np *pp, int x){
	np *qq;
	qq = pp;
	while(*qq != NULL && x != (*qq)->num)
		qq = (x < (*qq)->num ? &(*qq)->left : &(*qq)->right);
	return qq;
}                          

void *getmemory(int n){
	void *p=malloc(n);
	if (p == NULL) puts("Not enought memory\n"), exit(1);
	return p;
}

void insert(np *pp, int x){
	np *qq;
	qq = search(pp, x);
	if (*qq == NULL){
		*qq = (node *)getmemory(sizeof(node));
		(*qq)->num = x;
		(*qq)->left = (*qq)->right = NULL;
	}
}

np copyTree(np *pp){
np qq;
	if (pp != NULL){
		copyTree(&(*pp)->right);
		insert(&qq, (*pp)->num);
		copyTree(&(*pp)->left);
	}
return qq;
}

void main(void){
np root = NULL;
np newRoot;
// build tree....
//...
printTree(root, 6);  // this function prints the tree.

newRoot = copyTree(root);

printTree(newRoot, 6);
}