C++ Pointer and PointerApps

Q1) Using the Node definition given with the list example, modify the given traversal code assuming the list is sorted by key. If the element is not found, return a NULL. Of course, you should be as efficient as possible.

Q2) Using the Node definition given with the list example, write a function that inserts a key, id pair into the list assuming the list is sorted by key. You probably want to draw a picture first.

//Please write the c++ code and explain or write a comment, Thank you.

Traversing a List struct Node string key; int id; Node nextp; Node find (Node list, string name) 1 Node *head list; while ((head != NULL) && (name != head->key ) ) head head->nextp; return head