java structures Data strucures for the principled programmer
书上的一个作业题目 求大神解答。一共2题，，。。
Which implementation of the size and isEmpty methods would you use if you had the potential for a million-element list. (Consider the problem of keeping track of the alumni for the University of Michigan.) How would you choose if you had the potential for a million small lists. (Consider the problem of keeping track of the dependents for each of a million income-tax returns.)
第二题:
Suppose we read n integers 1, 2, . . . , n from the input, in order. Flipping a coin, we add each new value to either the head or tail of the list. Does this shuffle the data?
多谢各位大神~~
