{"id":25419,"date":"2017-10-15T18:29:06","date_gmt":"2017-10-15T12:59:06","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=25419"},"modified":"2018-10-29T13:39:28","modified_gmt":"2018-10-29T08:09:28","slug":"java-programming-merge-sort-doubly-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/java-programming-merge-sort-doubly-linked-list\/","title":{"rendered":"Merge Sort for Doubly Linked List"},"content":{"rendered":"

Given a doubly linked list<\/a>, write a function to sort the doubly linked list in increasing order using merge sort<\/a>.<\/p>\n

For example<\/strong>, the following doubly linked list should be changed to 2<->4<->8<->10<\/p>\n

The important change here is to modify the previous pointers also when merging two lists.<\/p>\n

Doubly Linked List (DLL):<\/span><\/h2>\n

Doubly Linked List (DLL) is a list of elements and it varies from Linked List<\/a>. It allows navigation, either forward or backward<\/strong> when compared to Single Linked List<\/a>.\u00a0It has two pointers: previous pointer and next pointer<\/strong>.\u00a0Every element points to next of the list and previous element in list.<\/p>\n

Terms used in doubly linked list:<\/strong><\/p>\n