Recursion will stop if there is no dove in the linked list, due to lines:
```
1 bool search( Node
2 {
3 if ( ptr == NULL )
4 return false;
5 if ( ptr->info == dove ) {
6 bird = ptr->info;
7 return true;
8 }
9 return search( ptr->next, bird, dove );
10 }
```
which is called for a linked list (where start points to the first node) using the lines of code:
```
if ( search( start, bird, dove ) )
cout << “search successful” << endl;
```
A. 3-8
B. 5-8
C. 9
D. 3-4
1
You might also like to view...
How many ways is Thread implemented?
a. 1 b. 2 c. 3 d. None of the other choices
Because Office Web Apps use the standard file formats of the desktop version of Office 2010, you will have ________ viewing of documents.
a. high-fidelity b. low-resolution c. restricted d. pixelated