Question: (a) Write a recursive function in C++ that counts the number of nodes in a singly linked list. (b) Write a recurrence relation that represents
(a) Write a recursive function in C++ that counts the number of nodes in a singly linked list.
(b) Write a recurrence relation that represents the running time for your algorithm.
(c) Solve this relation and provide the classification of the algorithm using the Big-O asymptotic
notation.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
