Code in C++

~Create a sorted linked list

~Addition needs to add the node in the right position

#include using namespace std;

class IntNode { public: IntNode() {} IntNode(int d, IntNode* n) { data = d; next = n; } int getData() { return data; } IntNode* getNext() { return next; } void setData(int d) { data = d; } void setNext(IntNode* n) { next = n; }

private: int data; IntNode *next; };

bool search(IntNode* head, int target); void add(IntNode* &head, int value); void deleteNode(IntNode* &head, int value); void print(IntNode* head);

int main() { IntNode* head = NULL; char choice; int value; while(true){ cout>choice; choice = tolower(choice); switch(choice){ case 'a': cout>value; add(head,value); break; case 'd': cout>value; deleteNode(head,value); break; case 's': cout>value; cout

1 #include kiostream using namespace std; 4 class IntNode public: Int Node Int Node (int d, Int Node* n) data d; ext. 10 int getData 12 13 return data; 14 15 E IntNode getNext 16 return next; 17 18 void setData (int d) 19 20 data d 21 22 E void set Next (IntNode* n) 23 ext. 26 private: 27 int data; IntNode *n. ext. 28 29 30 31 bool search (IntNode* ead int target) 32 void add (IntNode* head, int value) 33 void deleteNode (IntNode* &head, int value) 34 void print (IntNode* ead) 35 36 E int main IntNode ead NULL 37 38 char choice; int value 39 40