private Node put(Node x, Key key, Value val) {
if (x == null) {
Node pre = floor(root, key);
Node nex = ceiling(root, key);
lastest = new Node(key, val, 1, 1, 1);
if (pre != null) pre.succ = lastest;
if (nex != null) nex.pred = lastest;
lastest.succ = nex;
lastest.pred = pre;
return lastest;
}
int comp = key.compareTo(x.key);
if (comp < 0) x.left = put(x.left, key, val);
else if (comp > 0) x.right = put(x.right, key, val);
else {
lastest = x;
x.value = val;
}
x.N = size(x.right) + size(x.left) + 1;
x.height = Math.max(height(x.left), height(x.right)) + 1;
x.avgCompares =
(avgCompares(x.left) * size(x.left) + avgCompares(x.right) * size(x.right) + size(x))
/ size(x);
return x;
}
public void put(Key key, Value val) {
if (lastest != null && lastest.key.compareTo(key) == 0) {
lastest.value = val;
return;
}
root = put(root, key, val);
}
