Delete Middle of Linked List
If there are even nodes, then there would be two middle nodes, we need to delete the second middle element.
If there are even nodes, then there would be two middle nodes, we need to delete the second middle element.
Algorithm:
- Use runner algorithm to find middle
Latest Source Code:
Github: ListMiddleRemover.java
Output:
1 2 3 4 1 2 4 1 2 3 4 5 1 2 4 5