AFor the nodes in the list, we can take their predecessor and successor respectively by calling the pred() and succ() interfaces.对于列表中的节点，我们可以通过调用 pred() 和 succ() 接口分别取其前驱和后继。
BOne of the important differences between find(e) and search(e) in list interface is that find(e) is suitable for all lists, and search(e) is applied to ordered lists.对于列表接口中的 find(e) 与 search(e)，其中一个重要区别在于 find 普适于所有列表，而 search 适用于有序列表。
CIf the length of the 'visible list' part is n, the ranks of the 'head', first, last, and 'trail' nodes are -1, 0, n, n + 1 respectively.如果一个列表的 visible list 部分长度为 n，则头、首、末、尾节点的秩分别为 -1, 0, n, n + 1
DIn constructing the list, we need to construct sentry nodes first.在构造列表时，我们需要首先构造哨兵节点。