singly-linked-list

This is a programming question asked during a written test for an interview. "You have two singly linked lists that are already sorted, you have to merge them and return a the head of the new list without creating any new extra nodes. The returned list should be sorted as well" The method signature is: Node MergeLists(Node list1, Node list2); Node class is below: class Node{ int data; Node next; } I tried many solutions but not creating an extra node screws things. Please help. Here is the accompanying blog entry http://techieme.in/merging-two-sorted-singly-linked-list/ Node MergeLists(Node

I am trying to swap two nodes. For example if the nodes are a and b I am passing the pointers (a-1)->next and (b-1)->next which are basically nodes a and b . void swap(struct stack **a,struct stack **b) { struct stack *temp1 = *a, *temp2 = *b, *temp3 = *b; *a = *b; (*b)->next = (temp1)->next; temp2 = temp1; (temp2)->next = temp3->next; } What am I doing wrong? When I am trying to print the nodes after calling the function it's an infinite loop. Please help. Grijesh Chauhan Why Infinite loop? Infinite loop is because of self loop in your list after calling swap() function. In swap() code

I'm writing some code that basically follows the following format: public static boolean isIncluded(E element) { Node<E> c = head; while (c != null) { if (cursor.getElement().equals(element)) { return true; } c = c.getNext(); } return false; } The code will search for an element in a list of nodes. However, my question is that if the while loop does find the element where the if-statement says it should return true, will it simply return true and break the loop? Furthermore, if it does then break the loop will it then carry on through the method and still return false, or is the method

This question already has an answer here: How to reverse a singly-linked list in blocks of some given size in O(n) time in place? 4 answers Can someone tell me why my code dosent work? I want to reverse a single linked list in java: This is the method (that doesnt work correctly) public void reverseList(){ Node before = null; Node tmp = head; Node next = tmp.next; while(tmp != null){ if(next == null) return; tmp.next = before; before = tmp; tmp = next; next = next.next; } } And this is the Node class: public class Node{ public int data; public Node next; public Node(int data, Node next){ this

I'm confused exactly about how to create structures in MIPS. I want to create a linked list implementation which computes the length of the strings stored, and sorts them in stored-order. Here is my code so far: # Global symbols # # string routines .globl read_string .globl strcmp .globl strlen .globl trim .globl strloop .globl replace # list routines .globl insert .globl insert_here .globl print_list .globl main # pseudo-standard library .globl get_string .globl malloc .globl print_newline .globl print_string ################################################## # Constants # .data MAX_STR_LEN: