class Node<T extends Comparable<T>> {
T object;
Node<T> left;
Node<T> right;
Node(T object) { ... }
Node(T object, Node<T> left, Node<T> right) { ... }
}
class LinkedList<T extends Comparable<T>> {
Node<T> head;
Node<T> tail;
int size;
void append(T o) { ... }
@Override
String toString() { ... }
class BinarySearchTree<T extends Comparable<T>> {
Node<T> root;
void insert(T o) { ... }
void inOrder(Node root) { ... }
void postOrder(Node root) { ... }
void preOrder(Node root) { ... }
private Node<T> createNewNode(T o) { ... }
Search efficiently for strings in large text files.
Node.java
class Node<T extends Comparable<T>> {
T object;
Node<T> left;
Node<T> right;
Node(T object) { ... }
Node(T object, Node<T> left, Node<T> right) { ... }
}
LinkedList.java
class LinkedList<T extends Comparable<T>> {
Node<T> head;
Node<T> tail;
int size;
void append(T o) { ... }
@Override
String toString() { ... }
}
BinarySearchTree.java
class BinarySearchTree<T extends Comparable<T>> {
Node<T> root;
int size;
void insert(T o) { ... }
void inOrder(Node root) { ... }
void postOrder(Node root) { ... }
void preOrder(Node root) { ... }
private Node<T> createNewNode(T o) { ... }
}
Word.java