Dynamique Structure

1. Needed functions

1.1. Malloc

1.2. Free

1.3. Calloc

1.4. Realloc

2. Role

2.1. Temporary Storage

3. Access

3.1. Sequential

4. Linked list

4.1. Operations

4.1.1. Insertion

4.1.1.1. Insert to front

4.1.1.2. Insert to middle

4.1.1.3. Insert to back

4.1.2. Deletion

4.1.2.1. delete front

4.1.2.2. Delete middle

4.1.2.3. Delete last

4.1.2.4. Delete all

4.1.3. Traverse

4.1.3.1. Modify Values

4.1.3.2. Count length

4.1.3.3. Search for value

4.1.4. Display

4.2. Types

4.2.1. Simple Linked List

4.2.2. Doubly Linked List

4.2.3. Circular Linked List

5. Stack

5.1. Operations

5.1.1. Initialization

5.1.2. Pushing

5.1.3. Poping

5.1.4. IsEmpty

5.1.5. Top

5.2. Type

5.2.1. LIFO

5.3. Accress

5.3.1. Front

6. Queue

6.1. Operations

6.1.1. Creation

6.1.2. Reversing

6.1.3. Pushing

6.1.4. Poping

6.1.5. IsEmpty

6.1.6. Top

6.2. Type

6.2.1. FIFO

6.3. Access

6.3.1. Front

6.3.2. Rear