Linked list theory based on Algorithm

1. Basic definition of linked list We have summarized the array of one of the two data structures before. This time, we will summarize the other - Linked List. Firstly, the bottom layers of dynamic array, stack and queue all rely on static array; Using resize to solve the fixed capacity problem may cause a lot of waste of memory space (f ...

Posted on Fri, 24 Sep 2021 08:04:08 -0400 by activeserver

Learning notes - circular linked list (expressed in C + +)

Students in school, please criticize and correct the deficiencies or errors in the narration. Disadvantages of one-way linked list We have learned the one-way linked list before, because the continuity does not need to be guaranteed during storage. Each node stores direct successors. We can easily insert and delete and expand the space. But w ...

Posted on Tue, 21 Sep 2021 17:20:45 -0400 by Judas

Data structure single linked list

1, Concept of linked list 1. What is a linked list Linked list, alias linked storage structure or single linked list, is used to store data with logical relationship of "one-to-one". Unlike the sequential list, the linked list does not limit the physical storage state of data. In other words, the physical storage location of dat ...

Posted on Mon, 20 Sep 2021 21:22:27 -0400 by jackthebookie

Speed pointer summary

Speed pointer definition The speed in the speed pointer refers to the moving step, that is, the speed of each forward movement. For example, you can make the fast pointer move forward 2 times along the linked list and the slow pointer move forward 1 time at a time. The speed of the speed pointer is only relative Fast and slow pointer exa ...

Posted on Mon, 20 Sep 2021 11:03:21 -0400 by grooveman

Both pictures and text, in simple terms, HashMap classic explanation

What is HashMap? HashMap is an asynchronous implementation of Map interface based on hash table. This implementation provides all optional mapping operations and allows the use of null values and null keys. This class does not guarantee the order of mapping, especially it does not guarantee that the order is constant. Data structure of HashMap ...

Posted on Sun, 19 Sep 2021 14:45:14 -0400 by lovelyvik293

Data structure - linked list

Linked list Linked list is a non continuous and non sequential storage structure on the physical storage unit. The logical order of data elements is realized through the pointer link order in the linked list. The linked list consists of a series of nodes (each element in the linked list is called a node), which can be generated dynamically at ...

Posted on Sun, 19 Sep 2021 00:22:31 -0400 by Dr Evil

Learning common data structures of Linux kernel

Common data structures of Linux kernel          Linux kernel provides many practical built-in data structures for developers. These structures can help developers save time in developing and designing personalized methods, and these data structures have rich and powerful functions. This paper mainly take ...

Posted on Sat, 18 Sep 2021 22:36:44 -0400 by thiscatis

[data structure and algorithm] Chapter 10, 11 and 12: balanced tree (2-3 search tree, red black tree) B tree and B + tree

10. Balanced tree The query efficiency of the previous binary search tree is much higher than that of the simple linked list and array. In most cases, it is true, but in the worst case, the performance of the binary search tree is still very poor For example, insert 9,8,7,6,5,4,3,2,1 data into the binary search tree in turn, and the resulti ...

Posted on Sat, 18 Sep 2021 20:22:35 -0400 by Teddy B.

Bidirectional linked list and LinkedHashMap

1. Advantages of two-way linked list over one-way linked list For insert operation, both single linked list and double linked list have O(1) time complexity. For deletion, we often see that the deletion time complexity of single linked list is O(1). In fact, this statement is not accurate. Because the deletion action is really O(1), just chang ...

Posted on Sat, 18 Sep 2021 20:12:29 -0400 by veroaero

560 - data structure (linked list)

Linear list linked list Linear table: each element has a precursor and a successor, that is, there is a node in front and a node behind, on a line. Suppose there is 100M memory, which is allocated one by one as the program runs. Now, on the 100M memory, the memory is allocated by the process during operation Memory is allocated one by one, b ...

Posted on Sat, 18 Sep 2021 19:24:21 -0400 by mariaak83