+ printf("The 2 Linked List are: \n");\r
+ printList(a); printf("\n");\r
+ printList(b); printf("\n");\r
+\r
+ /* Remove duplicates from linked list */\r
+ res = SortedMerge(a, b);\r
+// res = LL_merge(a, b);\r
+ \r
+ printf("Merged Linked List is: \n");\r
+ printList(res);\r
+}\r
+#endif\r
+/* C Program to remove duplicates from a sorted linked list */\r
+\r
+/* Drier program to test above functions*/\r
+void main()\r
+{\r
+ /* Start with the empty list */\r
+ struct node* head = NULL;\r
+ \r
+ /* Let us create a sorted linked list to test the functions\r
+ Created linked list will be 11->11->11->13->13->20 */\r
+ pushll(&head, 20);\r
+ pushll(&head, 13);\r
+ pushll(&head, 13); \r
+ pushll(&head, 11);\r
+ pushll(&head, 11);\r
+ pushll(&head, 11); \r
+ \r
+ printf("\n Linked list before duplicate removal ");\r
+ printList(head); \r
+ \r
+ /* Remove duplicates from linked list */\r
+ removeDuplicates(head); \r
+ \r
+ printf("\n Linked list after duplicate removal "); \r
+ printList(head); \r
+ \r