/*@
@ requires true;
@
@ ensures (\exists BinTreeNode n;
@ \old(\reach(root, BinTreeNode, left + right)).has(n) == true;
@ n.key == k) ==> size == \old(size);
@
@ ensures (\forall BinTreeNode n;
@ \old(\reach(root, BinTreeNode, left + right)).has(n) == true;
@ n.key != k) ==> size == \old(size) + 1;
@
@ ensures (\exists BinTreeNode n;
@ \reach(root, BinTreeNode, left + right).has(n) == true;
@ n.key == k);
@
@ signals (RuntimeException e) false;
@*/
public boolean insert(int k) {
icse.bintree.BinTreeNode y = null; // mutGenLimit 0
icse.bintree.BinTreeNode x = root; // mutGenLimit 0
// @decreasing \reach(x, BinTreeNode, left+right).int_size();
while (x != null) { // mutGenLimit 0
y = x; // mutGenLimit 0
if (k < x.key) { // mutGenLimit 0
x = x.left; // mutGenLimit 0
} else {
if (k > x.key) { // mutGenLimit 0
x = x.right; // mutGenLimit 0
} else {
return false; // mutGenLimit 0
}
}
}
x = new icse.bintree.BinTreeNode(); // mutGenLimit 0
this.root.key = k; // mutGenLimit 1
if (y == null) { // mutGenLimit 0
root = x; // mutGenLimit 0
} else {
if (k < y.key) { // mutGenLimit 0
y.left = x; // mutGenLimit 0
} else {
y.right = x; // mutGenLimit 0
}
}
x.parent = y; // mutGenLimit 0
size += 1; // mutGenLimit 0
return true; // mutGenLimit 0
}
/*@
@ requires (\forall BinTreeNode n1;
@ \reach(root, BinTreeNode, left+right).has(n1);
@ (\forall BinTreeNode m1;
@ \reach(root, BinTreeNode, left+right).has(m1); n1 != m1 ==> n1.key != m1.key));
@
@ ensures (\exists BinTreeNode n2;
@ \old(\reach(root, BinTreeNode, left + right)).has(n2) == true;
@ \old(n2.key) == element)
@ <==> \result == true;
@
@ ensures (\forall BinTreeNode n3;
@ \reach(root, BinTreeNode, left+right).has(n3);
@ n3.key != element);
@
@ signals (RuntimeException e) false;
@*/
public boolean remove(int element) { // mutGenLimit 0
icse.bintree.BinTreeNode node = root; // mutGenLimit 0
/*@decreasing \reach(node, BinTreeNode, left+right).int_size();@*/
while (node != null && node.key != element) { // mutGenLimit 0
if (element < node.key) { // mutGenLimit 0
node = node.left; // mutGenLimit 0
} else {
if (element > node.key) { // mutGenLimit 0
node = node.right; // mutGenLimit 0
}
}
}
if (node == null) { // mutGenLimit 0
return false; // mutGenLimit 0
} else {
if (node.left != null && node.left.right != null) { // mutGenLimit 1
icse.bintree.BinTreeNode predecessor = node.left; // mutGenLimit 0
if (predecessor != null) { // mutGenLimit 0
/*@decreasing \reach(predecessor, BinTreeNode, right).int_size(); @*/
while (predecessor.right != null) { // mutGenLimit 0
predecessor = predecessor.right; // mutGenLimit 0
}
}
node.key = predecessor.key; // mutGenLimit 0
node = predecessor; // mutGenLimit 0
}
}
icse.bintree.BinTreeNode pullUp; // mutGenLimit 0
if (node.left == null) { // mutGenLimit 0
pullUp = node.right; // mutGenLimit 0
} else {
pullUp = node.left; // mutGenLimit 0
}
if (node == root) { // mutGenLimit 0
root = pullUp; // mutGenLimit 0
if (pullUp != null) { // mutGenLimit 0
pullUp.parent = null; // mutGenLimit 0
}
} else {
if (node.parent.left == node.parent) { // mutGenLimit 1
node.parent.left.parent = pullUp; // mutGenLimit 1
if (pullUp != null) { // mutGenLimit 0
pullUp.parent = node.parent; // mutGenLimit 0
}
} else {
node.parent.right = pullUp; // mutGenLimit 0
if (pullUp != null) { // mutGenLimit 0
pullUp.parent = node.parent; // mutGenLimit 0
}
}
}
size = size - 1; // mutGenLimit 0
return true; // mutGenLimit 0
}
/*@
@ requires (\forall BinTreeNode n1;
@ \reach(root, BinTreeNode, left+right).has(n1);
@ (\forall BinTreeNode m1;
@ \reach(root, BinTreeNode, left+right).has(m1); n1 != m1 ==> n1.key != m1.key));
@
@ ensures (\exists BinTreeNode n2;
@ \old(\reach(root, BinTreeNode, left + right)).has(n2) == true;
@ \old(n2.key) == element)
@ <==> \result == true;
@
@ ensures (\forall BinTreeNode n3;
@ \reach(root, BinTreeNode, left+right).has(n3);
@ n3.key != element);
@
@ signals (RuntimeException e) false;
@*/
public boolean remove(int element) { // mutGenLimit 0
icse.bintree.BinTreeNode node = root; // mutGenLimit 0
while (node != null && node.key != element) { // mutGenLimit 0
if (element < node.key) { // mutGenLimit 0
node = node.left; // mutGenLimit 0
} else {
if (element > node.key) { // mutGenLimit 0
node = node.right; // mutGenLimit 0
}
}
}
if (node == null) { // mutGenLimit 0
return false; // mutGenLimit 0
} else {
if (node.left != null && node.right != null) { // mutGenLimit 0
icse.bintree.BinTreeNode predecessor = node.left; // mutGenLimit 0
if (predecessor != null) { // mutGenLimit 0
while (predecessor.right != null) { // mutGenLimit 0
predecessor = predecessor.right; // mutGenLimit 0
}
}
node.key = predecessor.key; // mutGenLimit 0
node = predecessor; // mutGenLimit 0
}
}
icse.bintree.BinTreeNode pullUp; // mutGenLimit 0
if (node.left == null) { // mutGenLimit 0
pullUp = node.right; // mutGenLimit 0
} else {
pullUp = node.left; // mutGenLimit 0
}
if (node == root) { // mutGenLimit 0
root = pullUp; // mutGenLimit 0
if (pullUp != null) { // mutGenLimit 0
pullUp.parent = null; // mutGenLimit 0
}
} else {
if (node.parent.left == node) { // mutGenLimit 0
node.parent.left = pullUp; // mutGenLimit 0
if (pullUp != null) { // mutGenLimit 0
pullUp.parent = node.parent; // mutGenLimit 0
}
} else {
node.parent.right = pullUp; // mutGenLimit 0
if (pullUp != null) { // mutGenLimit 0
pullUp.parent = node.parent; // mutGenLimit 0
}
}
}
size--; // mutGenLimit 0
return true; // mutGenLimit 0
}
