Hello. This is a java problem please. I have some issues and I dont know how to
ID: 3722888 • Letter: H
Question
Hello. This is a java problem please. I have some issues and I dont know how to even start all over. Help please. There is a class and interface needed for this question and I have posted it under please. I have the incomplete class, I dont know if you would need it or just do it your way.
#Interface
package lib280.base;
import lib280.exception.AfterTheEnd280Exception;
import lib280.exception.ContainerEmpty280Exception;
/** A basic iterator for moving through a collection of items linearly.
It utilizes a cursor to keep track of the current item of the
sequence, and has functions to move forward and to the front of
the sequence. */
public interface LinearIterator280<I> extends Cursor280<I>
{
/** Is the current position before the start of the structure?. */
public boolean before();
/** Is the current position after the end of the structure?. */
public boolean after();
/** Advance one item in the data structure.
* @precond !after()
* @throws AfterTheEnd280Exception if the cursor is already in the after position and cannot be advanced.
*/
public void goForth() throws AfterTheEnd280Exception;
/**
* Go to the first item in the structure.
* @precond !isEmpty()
* @throws ContainerEmpty280Exception if this container is empty.
*/
public void goFirst() throws ContainerEmpty280Exception;
/** Move to the position prior to the first element in the structure. */
public void goBefore();
/** Move to the position after the last element in the structure. */
public void goAfter();
}
#Java Class
package lib280.tree;
import lib280.base.CursorPosition280;
public class ArrayedBinaryTreePosition280 implements CursorPosition280 {
protected int currentNode;
public ArrayedBinaryTreePosition280(int pos) {
currentNode = pos;
}
}
Write a class ArrayedBinaryTreeIterator280 which extends ArrayedBinaryTreePostion280 and implements the LinearIterator280 interface. This will be an iterator for the ArrayedBinaryTree280 class. ArrayedBinaryTreeIterator280 should be fairly easy to implement since you can pretty much copy all of the methods required by the LinearIterator280 interface from ArrayedBinaryTreeWithCursors280, with perhaps some small modification. A mostly incom- plete ArrayedBinaryTreeIterator280.java file has been provided in the tree package of lib280-asn5 to start you off. Extend ArrayedHeap280 to a class IterableArrayedHeap280 and write the following methods in IterableArrayedHeap280: ·Add a deleteAtPosition method to delete a specific item in the heap (which need not be the root). The item to be deleted should be specified by passing a reference to an ArrayedBinaryTreeIterator280 object. The algorithm for this is just a slight modification of the heap deletion algorithm where you swap the item at the end of the array with the item to be deleted, and then swap it with its larger child until it is larger than both its children. This method should be very similar to deleteItem from ArrayedHeap280Explanation / Answer
For me to be able to answer your question correctly, you need to provide me the all source files present in the package lib280 as all your java files are importing import lib280.*
To be very specific,
Once you provide the java files present in the package lib280, i will certainly help you with this assignment.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.