1.4.2 Operations

• insert, get an index to previous pointer
  //Consider if it’s the first element. 
  Insert(int k, const T &x) 
  chainNode<T> *i = new chainNode<T> (x); 
   
  _____________________________________________ //leftside is pointer pointed direction 
  _____________________________________________ //rightside is node, but in list, all nodes only 
  _____________________________________________ //can be accessed by a pointer. 
  _____________________________________________ //insert after p node (with new drawing pad, draw picture here.) 
  i->link = p->link; 
  p->link = i; 
  // i is inserted element, p is position. 
  //You can remember i=p p=i  and fore three links.
• insert, before p node, what should I do?
  1)create temp auto node, new a i node. 
   
  while(p->link) 
  2) copy value from p to temp node 
  3) copy value i to p. 
  4) copy temp value to i value 
  p = p->link.
• delete get an index to previous pointer
  Delete(int k, const T&x) 
  d = p->link; 
  p->link = d->link ; 
  delete d; 
  //d=p p=d and last three links
• Indirect addressing combines array and list. You should store pointer in array, and each pointer refer to random storage object. A typical usage is char* [] each item in array is char*(string), when you sort the strings, you just move pointers. It will save a lot of move time.
• In C#, it really support Generic List List<T> and nongeneric ArrayList.
  List<string> words = new List<string>(); 
  words.Add("avocado");