Linked lists connect nodes dynamically via pointers rather than contiguous memory blocks. Master node reversals, dummy node sentinel pointers, Floyd's cycle detection algorithm, and fast/slow mid-point search in C++.
Sentinel Dummy Nodes: Eliminates null checks when modifying list head pointers.
Floyd's Fast & Slow Pointer: Detects cycles and finds list midpoints in O(N) time & O(1) space.
In-Place Reversal: Reverses pointer directions iteratively without creating new nodes.
Merging Sorted Lists: Uses dummy head and two pointers to interleave nodes in O(N).