Question :
Suppose that a stack which contains a set of integers is implemented using an array. Write an algorithm that returns the number of positive integers in the stack.
Ensure that the stack holds the original set of data upon completion of the algorithm. You may use additional stacks in your algorithm.
An unique integer is stored in each node of a doubly-linked list which has a reference, start, that points to the first node of the list.
Write an algorithm to delete the node with the largest integer from the list. Design a recursive algorithm which finds the node with the largest value in a singly-linked list.