CLRS二叉搜索树

class BSTree
{
private:
    
    struct TreeNode
    {
        int key;
        TreeNode *p, *left, *right;
    };
    TreeNode *root;
    short i;


public:
    BSTree():root(nullptr),i(0){}
    void Insert(int k);
    /*TreeNode *getRoot(){ return root; } 返回root节点用于做类外中序遍历的参数*/
    void InorderTreeWalk(TreeNode *n = nullptr);


    
};

//插入
void BSTree::Insert(int k)
{
    TreeNode *z = new TreeNode();
    z->key = k; z->left = nullptr; z->right = nullptr;
    TreeNode *y = nullptr, *x = this->root;
    while (x)
    {
        y = x;
        if (z->key < x->key)
            x = x->left;
        else
            x = x->right;
    }
    z->p = y;
    if (!y)
        this->root = z;
    else if (z->key < y->key)
        y->left = z;
    else
        y->right = z;
}

//中序遍历
void BSTree::InorderTreeWalk(TreeNode *n)
{
    //初始化n，设置记录
    if (i == 0 && !n)
    {
        n = this->root;
        i++;
    }
    if (n)
    {
        InorderTreeWalk(n->left);
        cout << n->key << " ";
        InorderTreeWalk(n->right);
    }
}