Prentice.Hall.Introduction.to.Java.Programming,.Brief.Version.9th.(2014).[sharethefiles.com]

public boolean insert(E e) {
boolean successful = super.insert(e);
if (!successful)
return false; // e is already in the tree
else {
ensureRBTree(e);
}
}
return true; // e is inserted
/** Ensure that the tree is a red-black tree */
private void ensureRBTree(E e) {
Get the path that leads to element e from the root.
int i = path.size() – 1; // Index to the current node in the path
Get u, v from the path. u is the node that contains e and v
is the parent of u.
Color u red;
}
if (u == root) // If e is inserted as the root, set root black
u.setBlack();
else if (v.isRed())
fixDoubleRed(u, v, path, i); // Fix double-red violation at u
/** Fix double-red violation at node u */
private void fixDoubleRed(RBTreeNode u, RBTreeNode v,
ArrayList path, int i) {
Get w from the path. w is the grandparent of u.
// Get v's sibling named x
RBTreeNode x = (w.left == v) ?
(RBTreeNode)(w.right) : (RBTreeNode)(w.left);
if (x == null || x.isBlack()) {
// Case 1: v's sibling x is black
if (w.left == v && v.left == u) {
// Case 1.1: u < v < w, Restructure and recolor nodes
}
else if (w.left == v && v.right == u) {
// Case 1.2: v < u < w, Restructure and recolor nodes
}
else if (w.right == v && v.right == u) {
9