Java Algorithm – Delete a Linked List node at a given position – Linked List – Given a singly linked list and a position, delete a linked list
java algorithms and data structures
3 Articles
3
Java Algorithm – Topological Sorting – Graph Algorithms – Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices.
C Programming-Merge Sort for Doubly Linked List – Searching and Sorting – Merge sort for singly linked list is already discussed. The important change here is to modify the previous pointers also when merging two lists