Consider a non-empty doubly linked list (at least two elements) pointed by 'start' (start is not NULL). Write an algorit
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Consider a non-empty doubly linked list (at least two elements) pointed by 'start' (start is not NULL). Write an algorit
Consider a non-empty doubly linked list (at least two elements) pointed by 'start' (start is not NULL). Write an algorithm to split the list into two, containing all odd positioned elements in first list and all odd positioned elements in the second list.