See list_handout.pdf for the class definition and implementation of a double linked list. Rewrite the findnode(int index)functionto perform a forward search in the first half ofthe list if index<N/2 and a backward search in the second half of the list otherwise. The result should be that no more than N/2 nodes will be visited as part of a search.Hint: Sketch what you are trying to accomplish on a piece of paper before you thinkabout the code.
![list_handout 09/08/17 09:57:11 #include <iomanip> #include <iostream> using namespace std; Hint: Notice how the three different list implementations on the next several pages use the SAME public interface with the only differences being wrt the implementation details class 1ist/see next several pages Hint: Notice how the operator member functions are overloaded differently to support the different underlying 1ist types void printlist (const char operation, list &v) cout < setw (14)< operation << s= << v.size ( ) Hint: The array based list is similar to the std: :vector class The single and double linked lists mimic the std: list class We will make a few more improvements to make the similarities even more striking soon. See cplusplus.com for details on the two std container classes mentioned for (int i-0 i<v.size); i++) cout << cout <<n; int main(int argc, char argv) Hint: For HW2, you will implement single linked list class member functions push_front , pop front) and front). For HW3, you will implement an improved findnode ) member function for the double linked 1ist class cout << left; printlist (list v, v) list v; v.push back (7) printlist(v.push back (7), v) v.push back (8)printlist(v.push_back (8), v)i v.push_back (9)printlist (v.push_back (9), v) v.insert (1, 20) printlist (v.insert (1,20) , v v.erase (2) v.insert (0, 11) printlist (v.insert (0,11), v) v.push_back (2)printlist (push_back (2) , v)i v.pop back ) v.insert (1, 4) printlist (v.insert (1,4), v) Hint: The single and double linked list classes share the implementation of many member functi ns. These are defined in the former and referred to by in the latter to save space printlist (v.erase (2) , v) printlist (pop_back ), v)i Hint: If you cant wrap your head around the code, draw a simple picture similar to those drawn in class. print list (v[1] = 5, v); printlist (clear, v)i v.clear i unix> ./list list v v.push-back (7) s=1 : 7 v.push_back (8) s-2 7 8 ˇ·push-back (9) s=3 : 7 8 9 v.insert (1,20) : 7 20 8 9 v.erase (2) v.insert (0,11) -4:11 7 20 9 push back (2) 5 11 7 20 9 2 pop back ) v.insert (1, 4) S-511 47 20 9 v[1] = 5 clear ( s=0 : s-37 20 9 s-4:11 7 20 9 s=5 : 11 5720 9 S=0](https://d2vlcm61l7u1fs.cloudfront.net/media%2Fefd%2Fefdaafb1-6f52-46b6-90c3-9b4fe91b863d%2Fphps074DQ.png)
list_handout 09/08/17 09:57:11 #include #include using namespace std; Hint: Notice how the three different list implementations on the next several pages use the SAME public interface with the only differences being wrt the implementation details class 1ist/see next several pages Hint: Notice how the operator member functions are overloaded differently to support the different underlying 1ist types void printlist (const char operation, list &v) cout
