AlgoFlow — Algorithms, Visualized

dynamicsequentialpointer

Press play to start

1void inserirInicio(Lista* l, int x) {
  Celula* tmp = (Celula*)malloc(sizeof(Celula));
  tmp->elemento = x;
  tmp->prox = l->primeiro->prox;
  tmp->ant  = l->primeiro;
  if (tmp->prox != NULL)
      tmp->prox->ant = tmp;
  else
      l->ultimo = tmp;
  l->primeiro->prox = tmp;
11}

Step 1/0

Practice

LeetCode·#707 Design Linked ListMedium HackerRank·Insert at TailEasy NeetCode·Reverse a Linked ListEasy

Operation	Best	Average	Worst
inserirInicio	O(1)	O(1)	O(1)
inserirFim	O(1)	O(1)	O(1)
removerInicio	O(1)	O(1)	O(1)
removerFim	O(1)	O(1)	O(1)
pesquisar	O(1)	O(n)	O(n)

SpaceO(n)