filmov
tv
How to find the middle node in the linked list without using count or number of nodes in LL.

Показать описание
#AshokSoftwareDeveloper
1. Initialize two pointers to head of LL. One is slowptr and other one is fastptr.
3. Return slowptr(Middle of the LL).
1. Initialize two pointers to head of LL. One is slowptr and other one is fastptr.
3. Return slowptr(Middle of the LL).