Question

Assignment Description. In this assignment, you will design a class to represent a book of recipes using a doubly linked list. Your recipe book will support methods to add a recipe and get a recipe at a position; your main will use these to print all the names of all the recipes in the book.

1. Create a C++ class called RecipeBook. Your class must implement the following variables, constructors, and methods:
   • Create a private inner class called Node for implementing doubly-linked list structures. Nodes should have variables for the node’s data, as well as references to the Next and Previous nodes in the list.
   • RecipeBook needs member variables for the head and tail Nodes in the list, as well as a count of the number of elements in the list.
   • An accessor method getCount(), to get the number of elements in the list.
   • A method add, which takes a Recipe object parameter and adds it to the end of the linked list.
   • A method public: Recipe get(int index), which takes an integer parameter and returns the Recipe object at that index (0-based) in the list.
   • Additionally, implement these methods:
     1. public: boolean remove(Recipe r)
        • Takes a Recipe object and removes the node containing that object from the linked list, rearranging links as necessary to maintain the structure of the remaining list. Returns true if the given Recipe object was removed from the list, and false if it was not (meaning it was not found in the list).
     2. public: Recipe searchByName(String recipeName)
        • Searches for a Recipe in the book with the exact name as given. Returns the first Recipe whose name matches the parameter, or null if no such recipe is found.

Deliverables. Submit your .cpp source code file in a folder named assign6 in your csci133 folder. Make sure your compiled file name is assign6.

Answer 1

#include <iostream>
using namespace std;

// A linked list node
struct node
{
   string data;
   struct node *next;
   struct node *prev;
};

struct node *head=NULL,*tail=NULL;
int count=0 ;

void append()
{
count++;
string n;
  
cin >> n;
  
struct node* temp1=(struct node*)malloc(sizeof(struct node));
temp1->data=n;
temp1->next=NULL;
temp1->prev=NULL;
  
if(head==NULL)
{
head=temp1;
  
}
else
{
struct node* temp=head;
  
while(temp->next!=NULL)
{
temp=temp->next;
}
  
temp->next=temp1;
temp1->prev=temp;
  
  
}
  
}

void display()
{
struct node* temp=head;
  
if(head==NULL)
{
cout << "no elements in the list"<< endl;
}
else
{
while(temp!=NULL)
{
cout << temp->data;
  
temp=temp->next;
if(temp!=NULL)
{
cout << "-->";
}
}
}
cout<<endl;
}

void getindex()
{
int n,i;
cin >> n;
  
  
  
struct node* temp=head;
  
for(i=0;i<n;i++)
{
temp=temp->next;
}

cout << temp->data <<endl;
}

void getelement()
{
string s;
cin >> s;
int c=0;
struct node* temp=head;
  
while(temp->data!=s)
{
temp=temp->next;
c++;
}
  
if(temp==NULL)
{
cout << "element doesmt exist" << endl;
}
else
{
cout << "data present at " << c << " node" << endl;
}
}

void deleteelement()
{
string n;
cin >> n;
  
struct node *temp=head;
  
while(temp->data!=n)
{
temp=temp->next;
  
}
  
if(temp==NULL)
{
cout << "false : element doesmt exist" << endl;
}
else
{
  
struct node *temp1,*temp2;
  
if(temp->next!=NULL) // true if the the node to be deleted is not last node
{
temp1=temp->prev;
temp2=temp->next;
  
temp1->next=temp2;
temp2->prev=temp1;
}
else
{
temp1=temp->prev;
temp1->next=NULL;
}
cout << "true : data present and deleted successfully" << endl;
count--;
}
  
}

void countnodes()
{
cout << "no of nodes is " << count << endl;
}
int main()
{
  
  
while(1)
{
int o;
cin >> o;
  
switch (o)
{
case 1:append();break;
case 2:display();break;
case 3:countnodes();break;
case 4:getindex();break;
case 5:getelement();break;
case 6:deleteelement();break;
case 7:exit(0);
}
  
  
}
  
}

input

1
a
1
j
1
a
2
4
1
5
j
6
j
2
3
7

output

a-->j-->a
j
data present at 1 node
true : data present and deleted successfully
a-->a
no of nodes is 2