Description: Known to have a one-way circulation list, which each node contains three domains: pre, data and next, in which data for the data field, next to point to the successor node pointer domain, pre-domain for the pointer, but its value is empty (NULL), try to prepare this one-way circulation list algorithm changed to a two-way circulation list, even if the pre-node as a precursor to the target domain.
To Search:
File list (Check if you may need any files):
LinkList_C++.cpp
LinkList_C1.c
LinkList_C2.c
习题2.32.txt
Download