Introduce data structures to work with

src/aud/exam/prep/array/FullyUsedArray.java

@@ -0,0 +1,5 @@
+package aud.exam.prep.array;
+
+public class FullyUsedArray<T> {
+    public T[] theArray;
+}

src/aud/exam/prep/array/PartiallyUsedArray.java

@@ -0,0 +1,6 @@
+package aud.exam.prep.array;
+
+public class PartiallyUsedArray<T> {
+    public T[] theArray;
+    public int numberOfUsedSlots;
+}

src/aud/exam/prep/list/DoubleListItem.java

@@ -0,0 +1,7 @@
+package aud.exam.prep.list;
+
+public class DoubleListItem<T> {
+    public T key;
+    public DoubleListItem<T> next;
+    public DoubleListItem<T> prev;
+}

src/aud/exam/prep/list/SingleListItem.java

@@ -0,0 +1,6 @@
+package aud.exam.prep.list;
+
+public class SingleListItem<T> {
+    public T key;
+    public SingleListItem<T> next;
+}

src/aud/exam/prep/tree/BinaryTreeNode.java

@@ -0,0 +1,7 @@
+package aud.exam.prep.tree;
+
+public class BinaryTreeNode<T> {
+    public T key;
+    public BinaryTreeNode<T> left;
+    public BinaryTreeNode<T> right;
+}

src/aud/exam/prep/tree/MutliWayTreeNode.java

@@ -0,0 +1,7 @@
+package aud.exam.prep.tree;
+
+public class MutliWayTreeNode<T> {
+    public T[] theKeys;
+    public MutliWayTreeNode<T>[] theSuccessors;
+    public int numberOfKeys;
+}

src/aud/exam/prep/tree/TernaryTreeNode.java

@@ -0,0 +1,9 @@
+package aud.exam.prep.tree;
+
+public class TernaryTreeNode<T> {
+    public T key1;
+    public T key2;
+    public TernaryTreeNode<T> left;
+    public TernaryTreeNode<T> middle;
+    public TernaryTreeNode<T> right;
+}