Implementation of a basic generic tree, with labels of type T - Data Structure

// This implements a basic generic tree, with labels of type T, // pointer to the parent node, and a singly linked list of children nodes. class Tree<T> { private T label; private Tree<T> parent; private Tree<T> nextSibling; // next node on the list of parents's // children private Tree<T> firstChild; // first in the linked list of children // Getters and setters public T getLabel() { return label; } public void setLabel(T...

[ Read More ]

Stack implemented as array - Data Structure

// Stack implemented as array public class ArrayStack<T> { private T[] stack; private int numElements = 0; // points to slot after top element public ArrayStack(T[] s) { stack = s; } public boolean emptyStack() { return numElements == 0; } public T top() { return stack[numElements-1]; } public void push(T x) { stack[numElements] = x; numElements++; } public T pop() { numElements--; return stack[numElements]; } ...

[ Read More ]

Singly linked list with header - Data Structure

class OrderedList { private int value; private OrderedList next; // Note: No setValue() method or setNext() methods are provided, // since those could require reordering the list. public int getValue() { return value; } public OrderedList getNext() { return next; } // If X is in the list, returns the previous node. // If X is not in the list, returns the node for the greatest element less // than X. public OrderedList searchBefore(int x) { // Locate node containing X OrderedList n = this; ...

[ Read More ]

Ordered array of ints with no repetition - Data Structure

public class OrderedArray { private int numElements = 0; private int[] elements; // Constructor..Note: the caller has to provide the array of elements. // This is because Java generics do not allow a call "elements = new T[100]". // public OrderedArray(int[] elts) { elements = elts; } public int getNumElements() { return numElements; } public int nth(int n) { // return the Nth element if (n < numElements) return elements[n]; else return -1; } public int first() { return nth(0); } public int last()...

[ Read More ]

Stop Watch Program - To measure the amount of time to process each input

public class Stopwatch { private final long start; public Stopwatch() { start = System.currentTimeMillis(); } // return time (in seconds) since this object was created public double elapsedTime() { long now = System.currentTimeMillis(); return (now - start) / 1000.0; } }...

[ Read More ]