dmx2010

## Tree.scala
/**
 * D Holbrook
 *
 * Code Club: PO1
 *
 * (*) Define a binary tree data structure and related fundamental operations.
 *
 * Use whichever language features are the best fit (this will depend on the language you have selected).  The following operations should be supported:
 *
 *    Constructors

## SkipListNode.java
package org.rivendell.collections;

import java.lang.reflect.Array;

public class SkipListNode<T extends Comparable<? super T>> {

    private final T value;
    private final SkipListNode<T>[] next;
    /**
     * this is to provide index based access
	/**
	* D Holbrook
	*
	* Code Club: PO1
	*
	* (*) Define a binary tree data structure and related fundamental operations.
	*
	* Use whichever language features are the best fit (this will depend on the language you have selected). The following operations should be supported:
	*
	* Constructors
	package org.rivendell.collections;

	import java.lang.reflect.Array;

	public class SkipListNode<T extends Comparable<? super T>> {

	private final T value;
	private final SkipListNode<T>[] next;
	/**
	* this is to provide index based access