title: how to find middle node in singly linked list without traversal?
body: <p>how to find middle node in singly linked list without traversal ? </p>
  
  <p>is it possible in first place ?</p>
  
  <p>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 ..is there any other approach to find middle node in one traversal </p>