void Separate(Tree * t)
{
    if (t != NULL)
    {
	// separate the subtrees
	
	Separate(t->left);
	Separate(t->right);

	if (t->left != NULL && t->info == t->left->info)
	{
	    Insert(t,t->info-1,'L');
	    // t->left = new Tree(t->info-1,t->left);
	}
	if (t->right != NULL && t->info == t->right->info)
	{
	    Insert(t,t->info-1,'R');
	    // t->right = new Tree(t->info-1,0,t->right);
	}
    }
}