Programmer Group

What is a binary search tree? What are the characteristics of binary search tree? How to implement binary search tree? 1: Binary search tree is also called binary search tree and binary sort tree. As the name suggests, the search efficiency of binary search tree is very high, and binary search tree should meet the structural characteristics of ...

This article is reproduced from: Implementation of HashMap in Jdk1.7 and 1.8 Essential for interview: Principles and differences of HashMap, Hashtable and ConcurrentHashMap 1, A glimpse of HashMap HashMap is a more widely used hash table implementation, and in most cases, it can carry out put and get operations under the condition of consta ...

Data type: C language built-in type: — char short int long float double Custom type / construction type: - structure, enumeration, union Data storage - type details 1, Structure 1. Special declaration When declaring a structure, you can declare it incompletely Anonymous structure struct { int a; char c; double d; }s1, s2; ...

1, Principle and construction process 1. Principle Previously, we learned the text compressor based on LZW algorithm, which is based on the repetition of substrings in the text. Huffman coding is another text compression algorithm, which is based on the relative frequency of different symbols in a text. Suppose a text is a string composed ...

Title Link: https://vjudge.net/problem/POJ-2528 This question asks how many posters we can see in the end. If we are thinking about it, it will be more troublesome, because we are not sure whether the current poster will be covered by the later poster, but we can be sure that the later poster will not be covered by his previous poster, so we c ...

Learn the basic knowledge of linked list on LeetCode and summarize as follows: 1. Introduction to single linked list         Unlike an array, a single linked list only stores the value of the element. In addition to the value of the data, a single linked list also includes a reference field pointing to the next node, which ...

Sequence table What is the sequence table? Sequence table is to store elements in a continuous storage area in sequence, and the sequence relationship between elements is naturally represented by their storage order. Realize the function of adding, deleting, checking and modifying. Header file required for sequence table: #include<st ...

1. Algorithmic ideas The core idea of these two algorithms is: Only those elements that conform to a certain monotonicity are likely to be the answer. Screen out those elements that do not conform to a monotonicity according to the title requirements, store those elements that conform to a certain monotonicity in the stack or queue, and obtain ...

Some time ago, I saw the violent traversal method used by the company's games to realize the shielding word algorithm of the game. Later, I found that the efficiency of this algorithm is relatively low. Therefore, I learned about the trie tree on the Internet, so now I use the trie tree to realize a shielding word algorithm. Construction pri ...

Index of this series Linear table basis Linked listqueueStack Tree structure foundation Binary treeHeap and priority queueJoint search set Sorting algorithm Quick sortMerge sortCardinality / topological sorting Search Search Algorithm Binary search To be continued Binary search principle Binary search is an algorithm applied to ...