Data Structure's Note

So after the Introduction to Data Struct materials done, we continue to Linked List II materials, there are three general points we will discuss 1. Single Linked List 2. Double Linked List 3. Circular Doubly Linked List Because Single and Double Linked List have been discuss before, we only discuss third point. So circular Doubly Linked List is combination between Single and Double, also there is something new that each of Head or Tail is pointing to zero.   also there is a Insertion and Deletion: Insertion: There is nothing condition to pay attention when inserting. Deletion: There is four condition that we should attention with that node to be delete... 1. is the only Linked List 2. is the Head 3. is the Tail 4. is not a head or tail.

Materials : -Pointer & Array -Linked List -Pointer & Array Because today the topic is Introduction to Data Struct in this first class, so we need to review several materials such as Pointer & Array. Here are definition of Pointer & Array: Pointer : Pointers in C  language is a variable that stores/points the address of another variable(Source: Click Here ) Array:  Arrays  a kind of data structure that can store a fixed-size sequential collection of elements of the same type.(Source: Click Here ) or in easiest way to learn by this picture below:     -Linked List Linked list a sequence of data records and there is field that contains a refrence to the next record that allows Insertion and Deletion.  This algorithm for solving real-times problems that the number stored randomly and also sequential access of elements. There is two types of Linked List: 1. Single Linked List 2. Double Linked List Here is simple describe with...