Use of Partition List Test
Given a linked list A and a value B, the task is to partition the linked list such that all nodes with a value less than B appear before nodes with a value greater than or equal to B. The relative order of nodes within each partition should be preserved. The solution should create two separate linked lists, one for nodes less than B and one for nodes greater than or equal to B, and then merge the two lists together. The resulting linked list should have all nodes with values less than B appearing before nodes with values greater than or equal to B.