Unit 10 Indexes and Views

Unit 10 Indexes and Views 1. Common data structures 1. Stack Features: first in, last out, last in, first out 2. Queue Features: first in, first out 3. Array Fast query speed: data can be quickly located through address values ​​and indexes Low deletion efficiency: after deleting data, each data must be moved forward The addition efficiency is extremely low: after adding the position, each data is moved back and then the data is added. 4. Linked list The data in the link is stored free, and each element node contains the element value and the address of the next element The query speed is slow because each query must be queried sequentially through the head pointer Addition and deletion are relatively efficient, because you only need to re-point the pointer to the newly added element and the location of other elements No need to move. 5. Binary tree Binary tree, the full name is binary search tree. The stored data is based on the first piece of data. If it is smaller, it will be placed on the left, if it is greater, it will be placed on the right. There can only be one root node, and each…