Write the member function prior_v(T v, int count), which searches for a node with the value...

 

Transcribed Image Text:

Write the member function prior_v(T v, int count), which searches for a node with the value v (first occurrence), and then returns a list with all the nodes (up to count nodes) right before that node. If the value v is not found or the first occurrence of v is at the head node, the function should return an empty list. Write the member function prior_v(T v, int count), which searches for a node with the value v (first occurrence), and then returns a list with all the nodes (up to count nodes) right before that node. If the value v is not found or the first occurrence of v is at the head node, the function should return an empty list.