scapegoat tree rebuilding...please help!

[Thomas Dallaire]

Hi, I'm working on an assignment for school and I can't seem to get the rebuild function to work in this scapegoat tree.

protected void rebuild(ScapegoatNode<T> node) {
	//finds the size of the subtree at the scapegoat node and creates an array of the appropriate size
	sizeOfArray = 0;
	sizeArray(node);
	int size = sizeOfArray;
	ScapegoatNode<T>[] a = (ScapegoatNode<T>[]) Array.newInstance(node.getClass(), size);
	index = 0;
	// add the nodes to the array
	addToArray(node, a);
	// return the elements from the array into the tree
	addFromArray(a, 0, size);
}

public void sizeArray(ScapegoatNode<T> node) {
	if (node == null) return;
	sizeArray(node.left);
	sizeOfArray++;
	sizeArray(node.right);
}
	
public void addToArray(ScapegoatNode<T> node, ScapegoatNode<T>[] a){
	if (node == null) return ;
	addToArray(node.left, a);
	a[index] = node;
	removeB(node.x);
	index ++;
	addToArray(node.right, a);
}	
	
public void addFromArray(ScapegoatNode<T>[] a, int min, int max){
	int mid = ((max - min) / 2);
	if (min == max || mid+min > a.length-1) return;
	if(a[mid+min] != null)
	add(a[mid+min].x);
	addFromArray(a, min, mid);
	addFromArray(a, mid, max);
}

Instead of sorting the array of nodes I'm trying to traverse the sub tree in order so that I'll end up with a sorted set. The next step would be to add the middle element of the array, then the middle element of the left half, and so on until all the elements from the array have been added to the tree.

So far that's not working though...could anyone offer me some advice as to how I should go about this?

Thanks!