qq

int main()
{
    int choice, num, tt = 0;
    RBtree<int> tr;
    PrintUsage();
    cout << endl;
    cout << "\t\t*Please Press：";
    cin >> choice;      //输入选择的操作
    while (choice != 0)
    {
        tt++;
        if (choice < 6)
            cin >> num;      //输入 插入 or 删除 or 查找 的数据
        switch(choice) {
            case(1):      //选择1，插入数据
                cout << "\033[32m" << "\t\tInsert - " << num << endl << "\033[0m";
                tr.Insert(num);
                break;
            case(2):      //选择2，删除数据
                cout << "\033[32m" << "\t\tDelete - " << num << endl << "\033[0m";
                tr.Delete(num);
                break;
            case(3):      //选择3，查找数据
                cout << "\033[32m" << "\t\tFind - " << num << endl << "\033[0m";
                if (tr.Find(num))
                    cout << "\033[32m" << "\t\t" << num << " exist in tree" << endl << "\033[0m";
                else
                    cout << "\033[32m" << "\t\t" << num << " doesn't exist in tree" << endl << "\033[0m";
                break;
            case(4):      //选择4，查找后续结点
                if (!tr.Find(num))
                    cout << "\033[31m" << "\t\t" << num << " doesn't exist in tree" << endl << "\033[0m";
                else if (tr.Max(num) == num)
                    cout << "\033[32m" << "\t\t" << num << " doesn't have the successor" << endl << "\033[0m";
                else
                {
                    cout << "\033[32m" << "\t\tthe successor of " << num << " is: " << "\033[0m";
                    cout << "\033[32m" << tr.Succ(num) << endl << "\033[0m";
                }
                break;
            case(5):      //选择5，查找前向结点
                if (!tr.Find(num))
                    cout << "\033[31m" << "\t\t" << num << " doesn't exist in tree" << endl << "\033[0m";
                else if (tr.Min(num) == num)
                    cout << "\033[32m" << "\t\t" << num << " doesn't have the predecessor" << endl << "\033[0m";
                else
                {
                    cout << "\033[32m" << "\t\tthe predecessor of " << num << " is: " << "\033[0m";
                    cout << "\033[32m" << tr.Pred(num) << endl << "\033[0m";
                }
                break;
            case(6):      //选择6，查找最小值
                cout << "\033[32m" << "\t\tthe min value of the tree is: " << "\033[0m";
                cout << "\033[32m" << "\t\t" << tr.Min(num) << endl << "\033[0m";
                break;
            case(7):      //选择7，查找最大值
                cout << "\033[32m" << "\t\tthe max value of the tree is: " << "\033[0m";
                cout << "\033[32m" << "\t\t" << tr.Max(num) << endl << "\033[0m";
                break;
            case(8):      //选择8，打印二叉树
                cout << "\033[32m" << "\t\tprinting tree" << endl << "\033[0m";
                tr.Print();
                break;
            case(9):      //选择9，对树上数据进行从大到小排序
                cout << "\033[32m" << "\t\tSort from smallest to biggest" << "\033[0m";
                cout << "\t\t";
                tr.SortA();
                break;
            case(10):      //选择10，对树上数据进行从小到大排序
                cout << "\033[32m" << "\t\tSort from biggest to smallest" << "\033[0m";
                cout << "\t\t";
                tr.SortD();
                break;
            case(11):      //选择11，求树上数据的平均数值
                cout << "\033[32m" << "\t\tGet Average " << "\033[0m";
                tr.Average();
                break;
            case(12):      //选择12，竖向输出二叉树
                cout << "\033[32m" << "\t\tTest" << endl << "\033[0m";
                cout << "\t\t";
                tr.PPT();
                break;
            default:      //输入非法，重新输入
                cout << "\033[32m" << "\t\tthe choice number is out of range." << endl << "\033[0m";
                cout << "\033[32m" << "\t\tPlease enter again!" << endl << "\033[0m";
        }
        cout << "\033[36m" << "\t\t===========================================================================" << endl << "\033[0m";
        cout << "\t\t*Please Press：";
        cin >> choice;
    }
    cout << "\t\t";
    return 0;
}

 

template <class T>
void RBtree<T>::PPT()
{
    RBnode *x = ROOT;
    queue<ass> q;
    ass d, l, o, u;
    d.dep = 1;
    d.rr = x;
    q.push(d);      //根结点入队
    for (int i = 1; i <= pow(2, double(ww - 1)) - 1; i++)      //输出空格控制格式
        cout << " ";
    while (!q.empty())      //执行至所有结点遍历结束
    {
        d = q.front();
        if (d.dep < ww)      //防止叶子结点无限向下拓展
        {
            l.dep = d.dep + 1;
            l.rr = d.rr -> left;
            o.dep = d.dep + 1;
            o.rr = d.rr -> right;
            q.push(l);
            q.push(o);
        }
        q.pop();      //拓展完的结点退队
        if (!q.empty())
        {
            u = q.front();
            if (d.rr != NIL)
            {
                if (d.rr -> color == Black)
                    cout << d.rr -> value;
                else
                    cout << "\033[31m" << d.rr -> value << "\033[0m";
            }
            else
                cout << " ";
            if (d.dep == u.dep)
            {
                for (int i = 1; i <= pow(2, double(ww - d.dep + 1)) - 1; i++)      //输出空格控制格式
                    cout << " ";
            }
            else
            {
                cout << endl;
                cout << "\t\t";
                for (int i = 1; i <= pow(2, double(ww - u.dep)) - 1; i++)      //输出空格控制格式
                    cout << " ";
            }
        }
        else
        {
            if (d.rr != NIL)
            {
                if (d.rr -> color == Black)
                    cout << d.rr -> value;
                else
                    cout << "\033[31m" << d.rr -> value << "\033[0m";
            }
            else
                cout << " ";
        }
    }
    cout << endl;
}