Implement an array-based binary tree, in Java.

import net.datastructures.AbstractBinaryTree; import net.datastructures.Position;

public class ArrayBinaryTree extends AbstractBinaryTree {

@Override public Position left(Position p) throws IllegalArgumentException { // TODO Auto-generated method stub return null; }

@Override public Position right(Position p) throws IllegalArgumentException { // TODO Auto-generated method stub return null; }

@Override public Position root() { // TODO Auto-generated method stub return null; }

@Override public Position parent(Position p) throws IllegalArgumentException { // TODO Auto-generated method stub return null; }

}