[Solved]Write Code Manage Linked List Using Recursive Approach Q37218879

write a code to manage a linked list using recursiveapproach.
linkedlist.h 1 include <iostrean> 2 #include “linked list.h” 4 using namespace std; 6 void find(LinkedList& list, char ch) 7 t if (list.find(ch) else cout < ch ee endl; cout «e “found” cout e “did not find ” 12 13 14 15 int main) 17 18 16 ( LinkedList ust list.add(‘x) list.add(‘y) list.addl(‘z)i cout << list, find(list, ‘y 19 20 21 23 24 25 26 27 28 29 list.del(‘y cout << list; find(list, ‘y list.del(‘x cout «« list find(list, ‘y’ 30 31 32 list.del(‘z cout <« list; find(list, ‘y’ 34 35 36 31 return 0; 38 app.cp 1 ifndef LINKED LIST 2 #define-LINKED-LIST- 4 #include <ostream» 6 class LinkedList 8 public 9 LinkedList) LinkedList) 10 12 13 14 15 void add(char ch); bool find( char ch) bool del(char ch)s friend stdısostrean& operatorex(stdrrestreans out, LiabodLists iist) 17 i 18 19 #endif //-LINKED-LIST- Show transcribed image text linkedlist.h 1 include 2 #include “linked list.h” 4 using namespace std; 6 void find(LinkedList& list, char ch) 7 t if (list.find(ch) else cout

Expert Answer

---

Answer to write a code to manage a linked list using recursive approach. … . . .