Basic Knowledge (1) basic concepts of trees (2) Binary tree binary tree definition and its main properties binary tree sequential storage structure and chain storage...
Why do we need the concept of graph graph representation DFS (depth first traversal) BFS (breadth first traversal) Minimum spanning tree Prim algorithm Minimum spanning...
We often use TreeMap or HashMap in Java standard library. Their underlying implementation is red-black tree and hash table respectively. In this paper, we define...
The compressed storage of sparse arrays is to reduce the waste of computer storage space caused by invalid data in large arrays. Thus saving storage...
This is the 29th day of my participation in the August More Essay Challenge. Insert element operations in sequential tables are introduced: If we want...
Priority queue, priority processing. (Buy tickets, check out, WC). In the queue, people with emergency (special condition) can be dealt with first. Each element is...
I used HashMap data structure frequently in my daily work, and I also encountered related interview questions in my last job application. Read the source...