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

import java.util.ArrayList;
public class RBTree extends BinaryTree {
/** Create a default RB tree */
public RBTree() {
}
/** Create an RB tree from an array of elements */
public RBTree(E[] elements) {
super(elements);
}
/** Override createNewNode to create an RBTreeNode */
protected RBTreeNode createNewNode(E e) {
return new RBTreeNode(e);
}
/** Override the insert method to balance the tree if necessary */
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
ArrayList path = path(e);
int i = path.size() - 1; // Index to the current node in the path
// u is the last node in the path. u contains element e
RBTreeNode u = (RBTreeNode)(path.get(i));
23