Description: have the first node of the single list of all all for backward pointers. One of the additional space for the O (1), time costs for the O (n), where n is the number of nodes.
To Search:
File list (Check if you may need any files):
reverse\reverse\ReadMe.txt
.......\.......\reverse.cpp
.......\.......\stdafx.cpp
.......\.......\stdafx.h
.......\.......\targetver.h
.......\reverse.ncb
.......\reverse.sln
.......\reverse.suo
.......\reverse
reverse
Download