Question: using c++ datatstructure stack Q1:Write a function to accumulate the stack which consists of integer item. each item equals the sum of all the previous
using c++ datatstructure stack
Q1:Write a function to accumulate the stack which consists of integer item.
each item equals the sum of all the previous items, so the top item will be
the sum of all previous items.
using c++ datatstructure linkelist
Q2:
Write a function to search about an element in a linked list, and returns how many this item is repeated in the linked list. (5 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
