Doubly linked list

In a doubly linked list, does the head pointer's previous point to the node at the end of the list?

1
2
3
4
5
6
7
8
9
10
11
// enough code to define my words
struct Node{
  int data;
  Node* next;
  Node* previous;
};

class List{
private:
  Node* head;
};


Edit: I guess I can read...

Better question, is the STL list circular?
Last edited on
Better question, is the STL list circular?

No.
thanks
Topic archived. No new replies allowed.