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.

Traversing a List

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

** C++ course \ Pointers and Their Applications