288
правок
Изменения
→Методы
'''Node''' insert( h : Node, key : Key, value : Value)
if (h == null)
if (isRed(h.left) && isRed(h.right)) colorFlip(h);
int cmp = key.compareTo(h.key);
if (cmp == 0)
else
if (cmp < 0)
'''else'''
h.right = insert(h.right, key, value);
if (isRed(h.right) && !isRed(h.left))
if (isRed(h.left) && isRed(h.left.left))
'''return''' ''h''
</code>
<code>
public Value search(Key key)
Node x = root;
while (x != null)
int cmp = key.compareTo(x.key);
if (cmp == 0) return x.val;
else
if (cmp < 0)
x = x.left;
else
if (cmp > 0)
x = x.right;
return null;
</code>
==Удаление==
<code>
void deleteMin()
root = deleteMin(root);
root.color = BLACK;
</code>
<code>
Node deleteMin( h : Node)
if (h.left == null) return null;
if (!isRed(h.left) && !isRed(h.left.left))
h = moveRedLeft(h);
h.left = deleteMin(h.left);
return fixUp(h);
</code>
