Operations: enqueue , dequeue , front .
Joyanes highlights (using array with front/rear pointers) to avoid moving elements. 4. Recursion (Recursividad) Joyanes dedicates a full chapter to recursion as a problem-solving tool, not just a syntax trick. estructura de datos en java joyanes
| ADT | JCF Interface | Common Implementations | |-----|---------------|------------------------| | Lista | List<T> | ArrayList , LinkedList | | Pila | Deque<T> | ArrayDeque (prefer over Stack ) | | Cola | Queue<T> | LinkedList , PriorityQueue | | Árbol | SortedSet<T> | TreeSet | | Mapa | Map<K,V> | HashMap , TreeMap | Operations: enqueue , dequeue , front
private class Nodo<T> T dato; Nodo<T> siguiente; Nodo(T dato) this.dato = dato; Recursion (Recursividad) Joyanes dedicates a full chapter to
@Override public void agregar(T elemento) if (tamaño == elementos.length) expandir(); elementos[tamaño++] = elemento;
private void expandir() elementos = Arrays.copyOf(elementos, elementos.length * 2);
public class MiArrayList<T> implements ListaADT<T> private T[] elementos; private int tamaño; private static final int CAPACIDAD_INICIAL = 10; @SuppressWarnings("unchecked") public MiArrayList() elementos = (T[]) new Object[CAPACIDAD_INICIAL]; tamaño = 0;