How to find the average node in a uniquely linked list without crossing?


how to find middle node in singly linked list without traversal ?

is it possible in first place ?

In One traversal I Use the traditional method of using 2 pointers one which jump's 2 positions and other which jump's one position there any other approach to find middle node in one traversal

No, it's not possible. The addresses of the nodes are arbitrary, so there's no way of knowing them without traversing them.