An array is a collection of items stored at contiguous memory locations.
interface ArrayInterface<T> extends Iterable<T> {
public void add(T element);
public T get(int index);
public void set(int index, T element);
public void remove(int index);
public int size();
public void selection_sort();
public void bubble_sort();
public void insertion_sort();
public void quick_sort();
public void merge_sort();
public int linear_search(T element);
public int binary_search(T element);
}public void selection_sort();public void bubble_sort();public void insertion_sort();public void quick_sort();public void merge_sort();public int linear_search(T element);public int binary_search(T element);
A linked list is a sequence of data structures, which are connected together via links.
- Singly Linked List
- Doubly Linked List
- Circular Linked List
interface LinkedListInterface<T> extends Iterable<T> {
public void add(T data);
public void add(int index, T data);
public T get(int index);
public T remove(int index);
public int remove(T data);
public int size();
public boolean isEmpty();
public void clear();
public boolean contains(T data);
public int indexOf(T data);
public int lastIndexOf(T data);
public boolean detectLoop();
}public void add(T data);: Singly | Doubly | Circularpublic void add(int index, T data);: Singly | Doubly | Circularpublic T get(int index);: Singly | Doubly | Circularpublic T remove(int index);: Singly | Doubly | Circularpublic int remove(T data);: Singly | Doubly | Circularpublic int size();: Singly | Doubly | Circularpublic boolean isEmpty();: Singly | Doubly | Circularpublic void clear();: Singly | Doubly | Circularpublic boolean contains(T data);: Singly | Doubly | Circularpublic int indexOf(T data);: Singly | Doubly | Circularpublic int lastIndexOf(T data);: Singly | Doubly | Circularpublic boolean detectLoop();: Singly | Doubly | Circular
A Stack is a linear data structure that follows the LIFO (Last-In-First-Out) principle.
interface StackInterface<T> {
public void push(T element) throws OverflowException;
public T pop() throws UnderflowException;
public T peek() throws UnderflowException;
public boolean isEmpty();
public boolean isFull();
public int count();
public void change(int index, T element);
}public void push(T element) throws OverflowException;public T pop() throws UnderflowException;public T peek() throws UnderflowException;public boolean isEmpty();public boolean isFull();public int count();public void change(int index, T element);
A Queue is a linear data structure that follows the FIFO (First-In-First-Out) principle.
- Linear Queue
- Circular Queue
- Priority Queue (using Singly Linked List)
interface QueueInterface<T> {
public void enqueue(T element) throws QueueOverflowException;
public T dequeue() throws QueueUnderflowException;
public T peek() throws QueueUnderflowException;
public boolean isEmpty();
public boolean isFull();
public int size();
public void clear();
}public void enqueue(T element) throws QueueOverflowException;: Linear | Circular | Prioritypublic T dequeue() throws QueueUnderflowException;: Linear | Circular | Prioritypublic T peek() throws QueueUnderflowException;: Linear | Circular | Prioritypublic void clear();: Linear | Circular | Priority
Binary Search tree can be defined as a class of binary trees, in which the nodes are arranged in a specific order, i.e, the left subtree of a node contains only nodes with keys less than the node’s key, and the right subtree of a node contains only nodes with keys greater than the node’s key.
interface TreeInterface<T> {
public void insert(T data);
public void remove(T data);
public boolean contains(T data);
public Iterator<T> inorder();
public Iterator<T> preorder();
public Iterator<T> postorder();
}
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent