https://www.jianshu.com/p/fb4fb24ecc8f
https://baijiahao.baidu.com/s?id=1630285239174806636&wfr=spider&for=pc
Rookie Tutorial: https://www.runoob.com/java/java-data-structures.html
Talking about the data structure of the relational data access operation at a different structure.
1, the linear form
Linear list is an ordered sequence of N elements. The chain storage is divided into linear form, and sequentially stored (array), respectively, and implemented by LinkedList ArrayList class.
A memory cell array is continuous, linear table for storing the fixed size of the element.
The list is divided into single and double-linked list, the storage unit is physically non-continuous, non-sequential logical order of the storage structure, the data elements is realized by the link pointer in the linked list order.
2, the queue stack
Stack operation is a restricted linear form, after the data is advanced.
Queue table is also a restricted linear operation, the data FIFO.
3, tree
Tree is a non-linear configuration.
1) binary search tree
2) balanced binary tree
3) red-black tree
4, FIG.