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

}
// Adjust child links for nonleaf node
if (u.child.size() > 0)
leftNode.child.add(u.child.remove(0));
/** Perform a fusion with a right sibling */
private void rightSiblingFusion(int k, Tree24Node rightNode,
Tree24Node u, Tree24Node parentOfu) {
// Transfer an element from the parent to the right sibling
rightNode.elements.add(0, parentOfu.elements.remove(k));
}
// Remove the link to the empty node
parentOfu.child.remove(k);
// Adjust child links for nonleaf node
if (u.child.size() > 0)
rightNode.child.add(0, u.child.remove(0));
/** Get the number of nodes in the tree */
public int getSize() {
return size;
}
/** Preorder traversal from the root */
public void preorder() {
preorder(root);
}
/** Preorder traversal from a subtree */
private void preorder(Tree24Node root) {
if (root == null)return;
for (int i = 0; i < root.elements.size(); i++)
System.out.print(root.elements.get(i) + " ");
}
for (int i = 0; i < root.child.size(); i++)
preorder(root.child.get(i));
/** Inorder traversal from the root*/
public void inorder() {
// Left as exercise
}
/** Postorder traversal from the root */
public void postorder() {
// Left as exercise
}
/** Return true if the tree is empty */
public boolean isEmpty() {
return root == null;
}
/** Return an iterator to traverse elements in the tree */
public java.util.Iterator iterator() {
21