Shulou(Shulou.com)06/01 Report--

This article mainly introduces "what are the java data structures". In the daily operation, I believe that many people have doubts about the java data structure. The editor consulted all kinds of materials and sorted out simple and easy-to-use operation methods. I hope it will be helpful for you to answer the doubts about "what are the java data structures?" Next, please follow the editor to study!

1. Array, 2. Stack, 3. Queue, 4. Linked list, 5. Tree, 6. Hash table, 7. Heap, 8. Figure

1. Array: find fast, increase and delete slowly [one-dimensional array is linear]

two。 Stack: first in, then out LIFO [is a linear table]

3. Queue: FIFO FIFO [is a linear table]

4. Linked list: data field and pointer field constituent elements, including one-way linked list, two-way linked list, circular linked list [is linear list]

5. Tree: a "tree" describing an one-to-many relationship [tree structure]

Binary tree: each node has up to 2 child nodes

Complete binary tree: leaves cannot be separate right nodes

Balance tree: height difference must not be greater than 1 [submit search efficiency]

Red-black tree: the height difference limit is expanded to n [improve the ability to add and delete]

B-tree: horizontal spread node [mostly used for indexing: support range query, sort operation, IO efficiency [storage mode decision], high query efficiency (low tree height)]

6. Hash table: the value is stored in the storage location of [hash function: fun (key)], and the record can be queried directly without comparison. The array that stores the record is called hash table; hash function: a function that compresses a message of any length to a message digest of a fixed length. When the hash table is queried, the hash function is used again to convert key to the corresponding array subscript, and navigate to that space to get value.

7. Heap: heap is a complete binary tree, and its greatest characteristic is that the value of each node is greater than or equal to (or less than or equal to) the value of its subtree node. Therefore, the heap is divided into two categories, the big top pile and the small top pile.

8. Picture: often used to conceive

At this point, the study of "what are the java data structures" is over. I hope to be able to solve your doubts. The collocation of theory and practice can better help you learn, go and try it! If you want to continue to learn more related knowledge, please continue to follow the website, the editor will continue to work hard to bring you more practical articles!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.