二叉搜索树实现
template <typename Key, typename Value>
class BST {
private:
struct Node {
Key key;
Value value;
Node *left;
Node *right;
Node(Key key, Value value) {
this->key = key;
this->value = value;
this->left = this->right = n
原创
2021-09-07 17:43:10 ·
81 阅读 ·
0 评论