// Zorah Fung, CSE 143
// Class to represent a single value in a hash table.
// Note: We use a linked list for chaining because it's
// very fast to add at the front and doesn't take much memory
public class HashNode<E> {
    public E data;
    public HashNode<E> next;

    // Build a new node with the given data and next reference
    public HashNode(E data, HashNode<E> next) {
        this.data = data;
        this.next = next;
    }
}