问题描述

数据结构于算法上的作业，求各位大神解答

第一题
Write a List method, equals, that returns true exactly when the elements
of two lists are pair-wise equal. Ideally, your implementation should
work for any List implementation, without change.

第二题
Implement a recursive version of the contains method for Singly-LinkedLists.

第三题
Over time, the elements 1, 2, and 3 are pushed onto the stack, among others, in that order. What sequence(s) of popping the elements 1, 2 and 3 off the stack are not possible?

多谢各位抽出时间
谢谢啦。。。

解决方案

算法与数据结构 第五次作业 身陷敌阵

解决方案二：

作业自己写。别偷懒！是人都不会给你答案！