Description: The side of the original list
Pointer to the first cycle of NULL (the end), and then-
First traversal from scratch one by one, and then read into a list (the key is to build the list Insert), traverse the end, but also build a list, is one such idea, the procedure should not be too difficult to let , try your own on the list.
Completed at the beginning of your list derived from a single list of two-way prior to this list in a single base class to add amendments to the current
To Search:
File list (Check if you may need any files):
倒向单链表
..........\Debug
..........\.....\List.obj
..........\.....\vc60.idb
..........\.....\vc60.pdb
..........\.....\倒向单链表.exe
..........\.....\倒向单链表.ilk
..........\.....\倒向单链表.pch
..........\.....\倒向单链表.pdb
..........\.....\测试.obj
..........\List.cpp
..........\list.h
..........\Node.h
..........\倒向单链表.dsp
..........\倒向单链表.dsw
..........\倒向单链表.ncb
..........\倒向单链表.opt
..........\倒向单链表.plg
..........\测试.cpp
Download