find the middle element of a singly linked list without iterating the list more than once?
Solution- ### Python
Node* getMiddle(Node *head){ struct Node *slow = head; struct Node *fast = head; if (head) { while (fast != NULL && fast->next != NULL) { fast = fast->next->next; slow = slow->next; } } return slow;}Top comments(0)
Subscribe
For further actions, you may consider blocking this person and/orreporting abuse
