package tree;

import exceptions.BoundaryViolationException;
import exceptions.EmptyTreeException;
import exceptions.InvalidPositionException;
import position.Position;

import java.util.Iterator;

/**
 * Created with xgiovio.macbookair.
 * User: xgiovio
 * Date: 07/04/14
 * Time: 15:45
 */
public class LinkedTree <E> implements Tree<E> {


    @Override
    public int size() {
        return 0;
    }

    @Override
    public boolean isEmpty() {
        return false;
    }

    @Override
    public Iterable<Position<E>> positions() {
        return null;
    }

    @Override
    public E replace(Position<E> v, E e) throws InvalidPositionException {
        return null;
    }

    @Override
    public Position<E> root() throws EmptyTreeException {
        return null;
    }

    @Override
    public Position<E> parent(Position<E> v) throws InvalidPositionException, BoundaryViolationException {
        return null;
    }

    @Override
    public Iterable<Position<E>> children(Position<E> v) throws InvalidPositionException {
        return null;
    }

    @Override
    public boolean isInternal(Position<E> v) throws InvalidPositionException {
        return false;
    }

    @Override
    public boolean isExternal(Position<E> v) throws InvalidPositionException {
        return false;
    }

    @Override
    public boolean isRoot(Position<E> v) throws InvalidPositionException {
        return false;
    }

    @Override
    public Iterator<E> iterator() {
        return null;
    }
}