京东QQ设置码
随便拉实物
✈️@nianqingcaiqingkuang
bool insert(const K& key,const V& value) {
if (_root == nullptr) { _root = new BSTreeNode<K, V>({key,value}); return true; }
Node* cur = _root;
Node* parent = _root;
while (cur) {
if (key > cur->K) {
parent = cur;
cur = cur->right;
}
else if (key < cur->K) {
parent = cur;
cur = cur->left;
}
else {
return false;
}
}
if (key > parent->K) {
parent->right = new Node(key,value );
return true;
}
else {
parent->left = new Node(key,value );
return true;
}
}
bool insert(const K& key,const V& value) {
if (_root == nullptr) { _root = new BSTreeNode<K, V>({key,value}); return true; }
Node* cur = _root;
Node* parent = _root;
while (cur) {
if (key > cur->K) {
parent = cur;
cur = cur->right;
}
else if (key < cur->K) {
parent = cur;
cur = cur->left;
}
else {
return false;
}
}
if (key > parent->K) {
parent->right = new Node(key,value );
return true;
}
else {
parent->left = new Node(key,value );
return true;
}
}