Can you tell me which basic operations on a list can cause an use of stack proportional to the size of the list? (I mean, looping on all elements...)
I have problems with stack size.
Is iterator post-incrementing dangerous in this sense?
No need in recursive implementation of basic list operations. Overloaded pre- and postincrement of list iterators have absolutely straitforward codes, I can't imagine stack-consumed implementation of these operators.
public class GrossmontBank
//class variables (global - accessible throughout this class)
//scanner object to be used throughout
private static Scanner input = new Scanner(System.in);