DATASTRUCT data Structure--outline

Data

First, the collection

Second, linear structure (emphasis)
There is a one-to-one relationship between elements and elements
Storage mode:
Sequential storage (sequential table)
Chained storage (linked list: single-linked list, one-way loop linked list, double-linked list, two-way circular link list, kernel linked list)
A special linear structure
Stack
Insert Delete is allowed only on the same side of the table, insert is called into the stack, delete is called the stack, allowing one end of the operation to be called the top of the stack, and the other end is called the bottom of the stack.
LIFO-----"LIFO"

Queue
Inserts are allowed at one end of the table, and the other end is deleted.
Insert called queue, delete called Make team. The team at the end of the queue, the end of the team is called the enemy.

Three, tree-shaped structure
There is a one-to-many relationship between elements and elements
1. Basic concepts of the tree
2. Traversal of the tree
3. Two fork sorting tree

Hash table

Four, graphic structure
There are many-to-many relationships between elements and elements

DATASTRUCT data Structure--outline