Answers for "middle node of linked list"

C++

0

middle node of linked list

int middleNode(ListNode head) {
    ListNode slow = head
    ListNode fast = head
    while (fast != null and fast.next != null) {
        slow = slow.next
        fast = fast.next.next
    }
    return slow.data
}

Posted by: Guest on April-22-2022

Source

Code answers related to "middle node of linked list"

Code answers related to "C++"

Browse Popular Code Answers by Language

Python

Javascript

Whatever

Shell/Bash

CSS

Html

PHP

SQL

Java

C#