tail pointer - linked list

[Space_Cowboy]

newbie linked list question.

How does a tail pointer traverse? I think I learned in this my class but I can't remember anything...

Does a tail pointer traverse opposite direction of a head pointer?

head-> node1/next->node2/next->node3/next->node4/null

null/node4<-next/node3<-next/node2<-next/node1<-tail

I am guessing this is a linear linked list...

[Space_Cowboy]

Originally posted by Salem
It's
head->node1/next->node2/next->node3/next->node4/null

null/node1<-prev/node2<-prev/node3<-prev/node4<-tail

Thank you thank you thank you!!!