Learn basic concept of c , c++ and python programming in regularcodes.com
Print middle N nodes of linked list
Suppose linked list contain following nodes [ 1, 2, 3, 4, 5, 6, 7, 8 ,9, 10 ]. Our goal is to Print middle N nodes of linked list.
The following cases are follow of this problem.
Case 1 : first and last node are not a part of middle nodes. Example linked list contain 3 nodes [1,2,3]. and there are only one middle . if user are given to print 2 middle node of linked list then it is not possible.
Case 2 : if two set of middle node then print first set of linked list. example [1,2,3,4,5] if print 2 middle nodes. then possible to sets A [2,3] and B[3,4]. in this case print first set.
View pointers and nodes.
Example : print middle 6 nodes.
Example 2: N=4.
C program to print Middle N nodes of linked list . Iterative approach.