public class KTree<E> implements TreeIterable<E> {
/****************************************/
/* YOUR CODE SECTION! */
/****************************************/

private E[] arrayTree;
private int k;

/*
* KTree Constructor
* @param arrayTree array representation of tree
* @param k number of children for each node in tree
*/
@SuppressWarnings("unchecked")
public KTree(E[] arrayTree, int k) {
if (k < 2)
throw new InvalidKException();
this.arrayTree = (E[]) new Object[arrayTree.length];
this.k = k;
for (int i = 0; i < this.arrayTree.length; i++) {
this.arrayTree[i] = arrayTree[i];
}

}

/*
* Method to get K
* @return k number of children for each node in tree
*/
public int getK() {
return this.k;
}

/*
* Method to get size
* @return size of tree
*/
public int size() {
int size = 0;
for (int i = 0; i < this.arrayTree.length; i++) {
this.arrayTree[i] = arrayTree[i];
if (this.arrayTree[i] != null) {
size++;
}
}
return size;
}

/*
* Method to get height
* @return height of tree
*/
public int height() {
int maxIndex = 0;
for (int i = 0; i < this.arrayTree.length; i++) {
if (this.arrayTree[i] != null && i > maxIndex)
maxIndex = i;
}
int heightTotal = 0;
int height = 0;
while (maxIndex > heightTotal) {
heightTotal += Math.pow(k, height);
height++;
}
if (heightTotal > maxIndex)
height--;
return height;
}

/*
* Method to get value in tree
* @param i index of value in tree
* @return value in tree
* @throws IllegalArgumentException
*/
public E get(int i) throws IllegalArgumentException {
if (i < 0 || i >= this.arrayTree.length || this.arrayTree[i] == null)
throw new IllegalArgumentException();
return this.arrayTree[i];
}

/*
* Method to set value in tree
* @param i index of value in tree
* @param E value to set in tree
* @return boolean indicating if set is successful
* @throws InvalidTreeException
*/
@SuppressWarnings("unchecked")
public boolean set(int i, E value) throws InvalidTreeException {
if (i < 0)
return false;
if (value == null) {
if (i >= this.arrayTree.length || this.arrayTree[i] == null) {
return false;
} else {
for (int j = 1; j <= this.k; j++) {
if (this.k * i + j >= this.arrayTree.length || this.arrayTree[this.k * i + j] == null)
continue;
else
return false;
}
this.arrayTree[i] = value;
} return true;
} else {
if (i >= this.arrayTree.length || this.arrayTree[i] == null) {
int parentIndex = (i - 1) / this.k;
if (parentIndex >= 0 && parentIndex < this.arrayTree.length &&
this.arrayTree[parentIndex] != null) {
if (i >= this.arrayTree.length) {
E[] arrayTree2 = (E[]) new Object[i+1];
for (int j = 0; j < this.arrayTree.length; j++) {
arrayTree2[j] = this.arrayTree[j];
}
this.arrayTree = arrayTree2;
}
this.arrayTree[i] = value;
return true

Create a method called sum2DArray that will return the sum of all o...