Write a function that merges 2 BST into a new BST.

Difficulty level
This exercise is mostly suitable for students 
void merge(BST B, BST *C)
{
    if(B)
    {
        insert_BST_rec(C,B->data);
        merge(B->left,C);
        merge(B->right,C);
    }
}
Back to the list of exercises
Looking for a more challenging exercise, try this one !!
LCM between 2 numbers using recursion - version 1