Skip to main content

Loading page content

Find Middle Node

easy

T: O(n)S: O(1)

Size6

Operation: Find Middle uses fast/slow pointers in O(n)

State:

Current node

Visited node

Compared node

Found node

Link pointer

Inserted node

Deleted node

Link complete

Swapped pointers

Operation successful

No element state is highlighted for this setup step.

Loading visualizer…

Pseudocode

1function findMiddle(head):

2 slow = head, fast = head

3 while fast is not null and fast.next is not null:

4 slow = slow.next

5 fast = fast.next.next

6 return slow

No pseudocode line selected.

Loading syntax highlighter…

No code line selected.

Preparing step explanation…

Generate steps to inspect the execution log.