TheAlgorithms/Go

Adding functionality to delete from middle of a linkedlist

the-pinbo opened this issue · 0 comments

Description
The linkedlist package implemented does not have a function to remove a node from the middle of the list

For new implementation:

  • Add a function which removes an element form the middle

For enhancement:

  • Implement remove function in file
    • Let's say we have this linekd list:
      1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7 -> nil
    • Supposed we are asked to delete 4
    • After deleting linekd list:
      1 -> 2 -> 3 -> 5 -> 6 -> 7 -> nil