Data type and data structure of each node on the basis of the algorithm list indicates how

. 1 #include <stdio.h>
 2  
. 3 typedef struct Node {
 . 4      int Data; // data field 
. 5      struct Node * pNext; // pointer field, pointing to itself with the data type (struct Node) 
. 6 } NODEs, pNode * ; // NODEs == struct Node, 
. 7 pNode == struct Node *
 . 8  
. 9  int main () { 
 10      return  0 ;
 . 11 }

 

The list Category:

　　Single list

　　Doubly linked list:

　　　　Each node has two pointer field, a pointer field pointing toward the front of the left and right behind the pointer field pointing

　　Circular list:

　　　　Any node can find all other nodes, the last node pointer field points to the first node

　　Non-circular list