View source for TADM2E 3.20

Node* find_middle(Node *top) {
    int k=0;
    Node *middle=top, *cur=top;
    while (cur) {
        cur = cur-&gt;next;
        ++k;
        if (k%2 == 0)
            middle = middle-&gt;next;
    }
    return middle;
  }

[Also, can be done by improving one pointer two and one pointer one node(s) at a time. When the two node pointer reaches end, the one node pointer is in the middle.]