Array
Features: stored in the memory is continuous
Query fast, slow additions and deletions
List
Features: stored in memory is not continuous, achieved through the adjacent recording elements of each other's address
Query slow, fast additions and deletions
Stack
Features: linear limited operation table, (the insertion and deletion only one end)
Last out
Insert and delete only at one end (top of the stack)
queue
Features: linear operation restricted table
FIFO
Insertion and deletion are at both ends (top of the stack and the bottom stack)
tree
Hash table