Некорректное удаление элемента бинарного дерева поиска

#include <iostream>
#include <Windows.h>
using namespace std;
////////////////////////////////////////////////////////////////////////////
 
struct Node
{
    int info, level = 0;
    Node *left, *right;
};
///////////////////////////////////////////////////////////////////////////
 
void GoToXY(short x, short y)
{
    HANDLE StdOut = GetStdHandle(STD_OUTPUT_HANDLE);
    COORD coord = { x, y };
    SetConsoleCursorPosition(StdOut, coord);
}
///////////////////////////////////////////////////////////////////////////
 
void PRINT(Node *&MyTree, short x, short y, int level, char c)
{
    if (MyTree)
    {
        if (level > 0 && c != 'k')
        {
            if (c == 'l') x -= 5;
            else x += 5;
        }
        else if (c != 'k')
            if (c == 'l') x -= 7;
            else x += 7;
 
            GoToXY(x, y += 2);
            level--;
            cout << MyTree->info;
            PRINT(MyTree->left, x, y, level, 'l');
            PRINT(MyTree->right, x, y, level, 'r');
    }
}
///////////////////////////////////////////////////////////////////////////
 
void del(Node *&Tree)
{
    if (Tree != NULL)
    {
        del(Tree->left);
        del(Tree->right);
        delete Tree; 
    }
}
///////////////////////////////////////////////////////////////////////////
 
void add_node(int info, Node *&MyTree)
{
    if (MyTree == NULL)
    {
        MyTree = new Node;
        MyTree->info = info;
        MyTree->left = MyTree->right = NULL;
    }
 
    if (info < MyTree->info)
    {
        if (MyTree->left != NULL) add_node(info, MyTree->left);
        else
        {
            MyTree->left = new Node;
            MyTree->left->left = MyTree->left->right = NULL;
            MyTree->left->info = info;
            MyTree->level += 1;
        }
    }
 
    if (info > MyTree->info)
    {
        if (MyTree->right != NULL) add_node(info, MyTree->right);
        else
        {
            MyTree->right = new Node;
            MyTree->right->left = MyTree->right->right = NULL;
            MyTree->right->info = info;
            MyTree->level += 1;
        }
    }
}
/////////////////////////////////////////////////////////////////////////
 
void sort(Node *&MyTree)
{
    system("cls");
    while (MyTree->right != NULL)
    {
        MyTree = MyTree->right;
        cout << MyTree->info << endl;
        if (MyTree->right == NULL)
        {
            cout << "Deleting.. " << MyTree->info << endl;
            MyTree->right = NULL;
        }   
    }
}
///////////////////////////////////////////////////////////////////////
int main()
{
    Node *Tree = NULL;
    int x = 80, y = 10;
    int kod, info, key = 1;
    while (true)
    {
        cout << "1 - ADD; 2 - PRINT; 3 - SORT; 4 - CLEAR WINDOW 0 - CLEAR AND OUT" << endl;
        cin >> kod;
        switch (kod)
        {
        case 1:
            cout << "Input the number: " << endl;
            while (key != 666)
            {
                cin >> info; add_node(info, Tree);
                key = info;
            }
            key = 0;
            break;
        case 2: PRINT(Tree, x, y, Tree->level, 'k'); y = 10; x = 80; cout << "\n\n\n\n\n"; break;
        case 3: sort(Tree->left->right); PRINT(Tree, x, y, Tree->level, 'k'); y = 10; x = 78; cout << "\n\n\n\n"; break;
        case 4: system("cls"); break;
        case 0: del(Tree); exit(1);
        }
    }
}