I am wondering ,what if I initiate a doubly linked list with a head and tail pointers and I traverse the linked list with one pointer starting from the head and the other pointing from the tail , loop until both pointers meet? I undestand that the time complexity is still O(n). but can't there be a way to use like 4 pointers