Implementation principle of LinkedList

This article was written by the author of blog Park: Yicun Hui, personal blog address: https://www.cnblogs.com/zsql/

Just a simple class. The underlying structure of LinkedList is a two-way linked list with head / tail pointers, which can quickly operate on head / tail nodes. It allows the insertion of all elements, including null. Compare array (you can compare the ArrayList source code analysis here). The characteristic of the linked list is that it is more efficient to insert and delete elements at the specified position, but the search efficiency is not as high as that of the array. If you are familiar with the data structure of the two-way linked list, it is actually very simple. It is nothing more than to realize the functions of adding, deleting, querying, traversing and so on The structure diagram is as follows: