• ## Chain representation of linear list — double linked list

Time：2021-9-22

1. Comparison with single linked list Single linked list cannot be retrieved reverselyDouble linked list can be forward or backwardStorage structure: Typedef struct dnode {// defines the node type of the double linked list ElemType data; // Data domain struct DNode *prior, *next; // Predecessor and successor pointers } DNode, *DLinkList; 2. Insert node Insert […]

• ## Java Collections Framework source code analysis (5.3 – treemap, deletion of red black tree)

Time：2020-4-28

This is the last chapter of treemap and red black tree source code analysis. This time, we will teach you the algorithm of red black tree node deletion combined with treemap source code. Red black tree delete algorithm is more complex than insert, but don’t worry, this article will use a simple and clear explanation, […]

• ## Interpretation and implementation of binary search tree

Time：2020-3-17

Binary search tree is a tree that builds a group of unordered data into an ordered data. Its design idea is similar to dichotomy. It improves the efficiency of massive data search, and makes the way from traversal from the beginning to the end to binary search, and reduces the time complexity from O (n) […]

• ## Data structure and algorithm of hand tearing linked list

Time：2020-2-22

Preface The foundation of the bottom decides the development of the top. Let me know you’re focusing on technology. This series of articles GitHub back-end advanced guide has been included, this project is being improved, welcome star. Preview of this series: 1. What is a linked list? Linked lists are alsoLinear tableArray is a linear […]

• ## Creating Link List in C Language

Time：2019-10-2

I. Storage of nodes in linked list The left part of the node in the list is the stored data, and the right part is the address of the subsequent pointer pointing to the next node. C language usually defines a structure type to store a node, as follows: struct node { int data; Struce […]