Linked List Problems

More documents

Recommendations

Info

1818 — RecursiveReverse()(This problem is difficult and is only possible if you are familiar with recursion.) Thesolution is short and amazing. As before, the code should only make a single pass overthe list. Solving it, or even appreciating how it works requires real understanding ofpointer code and recursion.(Although the code for RecursiveReverse() is quite nice, there is another complex linkedlist recursion algorithm which is the most beautfiul of all — the O(n) conversion of anordered binary tree to a sorted doubly linked circular list. That algorithm may get its ownCS Education Library document someday.)/*Recursively reverses the given linked list by changing its .nextpointers and its head pointer. Takes a pointer (reference) to thehead pointer.*/void RecursiveReverse(struct node** headRef) {// your code...
19Section 3 — Solutions1 — Count() SolutionA straightforward iteration — just like Length().int Count(struct node* head, int searchFor) {struct node* current = head;int count = 0;while (current != NULL) {if (current->data == searchFor) count++;current = current->next;}}return count;Alternately, the iteration may be coded with a for loop instead of a while...int Count2(struct node* head, int searchFor) {struct node* current;int count = 0;for (current = head; current != NULL; current = current->next) {if (current->data == searchFor) count++;}}return count;2 — GetNth() SolutionCombine standard list iteration with the additional problem of counting over to find theright node. Off-by-one errors are common in this sort of code. Check it carefully against asimple case. If it's right for n=0, n=1, and n=2, it will probably be right for n=1000.int GetNth(struct node* head, int index) {struct node* current = head;int count = 0; // the index of the node we're currently looking atwhile (current != NULL) {if (count == index) return(current->data);count++;current = current->next;}}assert(0);// if we get to this line, the caller was asking// for a non-existent element so we assert fail.
Page 6 and 7: 6pointers. See problem #8 and its s
Page 8 and 9: 87) Build — Local ReferencesFinal
Page 10 and 11: 10void GetNthTest() {List myList =
Page 12 and 13: 12Pop()/*The opposite of Push(). Ta
Page 14 and 15: 14// Append 'b' onto the end of 'a'
Page 16 and 17: 16SortedMerge() should return the n
Page 20 and 21: 203 — DeleteList() SolutionDelete
Page 22 and 23: 22// Local references strategy for
Page 24: 24*backRef = NULL;}else {int hopCou
Page 27 and 28: 27}return(dummy.next);SuffleMerge()
Page 29 and 30: 29}}tail = tail->next;}return(dummy
Page 31 and 32: 31while (a!=NULL && b!=NULL) {if (a
Page 33: 33AppendixBasic Utility Function Im

Linked List Problems

Create successful ePaper yourself

Delete template?

Save as template?