## JS Implements Binary Find Tree

JS Implements Binary Sort Tree
Preface
_Binary sorting tree was not intended to be written, there was no difficulty found, want to start directly from the rotation of the AVL tree, but because I saw an interview topic from others, I inserted Key's code in my handwriting, so I thought I would do it. _There is still a big difference between ...

Added by **Voodoo Jai** on *Thu, 16 Sep 2021 02:45:48 +0300*

## Implementation of student information management system with linked list

Using linked list to realize student achievement management
Objective / function: linked list A, each node stores A new head node of linked list B1, B2, B3, B4 and B5. Scene: A grade, equivalent to A linked list There are 5 classes in this grade, with 5 people in each class, which is equivalent to the linked list B1 – B5 Do a student ach ...

Added by **RonDahl** on *Wed, 15 Sep 2021 04:59:24 +0300*

## Learn data structure together - linear table 1

Some concepts and definitions
1. Linear table, what is a linear table? We went to buy milk tea and there was a long line. This is the linear table. We call the roll in class and the names in the list from top to bottom. This is also a linear table.
2. What is the concept of linear table? A finite sequence of zero or more data elements.
3. It ...

Added by **MartinGr** on *Tue, 14 Sep 2021 01:46:19 +0300*

## [sword finger Offer] search algorithm

Today's problem begins to take the postgraduate entrance examination algorithm, and the problem has become much more interesting. The array inversion of the second problem is a very classic example, which is worth pondering carefully.
Sword finger Offer 04. Search in two-dimensional array
In an n* m two-dimensional array, each row is sorted i ...

Added by **spoons84** on *Mon, 13 Sep 2021 20:02:33 +0300*

## The 15th Chinese Northeast College Programming Contest D. lowbit

D. Lowbit
Original question link
In this question, we wonder whether it will become a normal interval operation after adding a certain number of times, which is similar to interval root opening. Then we find that it is true that when a number is added to a certain number of times, there is actually only one binary
...

Added by **mastercjb** on *Sun, 12 Sep 2021 03:33:04 +0300*

## C + + container notes

C + + container
General characteristics
A basic feature of all containers is that it holds elements in "value" semantics.
That is, the container stores copies and copies of elements, not references.
Cost: high overhead and reduced performance.
resolvent:
1. Try to implement transfer construction and transfer assignment function ...

Added by **lihman** on *Sat, 11 Sep 2021 22:54:58 +0300*

## Data Structure - Interpolation, Deletion and Lookup of Single Chain Table

Chain List Introduction
1.1 Comparison of advantages and disadvantages between order table and chain table
Sequence table Advantages: Any element in the table can be accessed at any time; Disadvantages: Insert and delete operations require a large number of elements to be moved.
Chain Storage Linear Table Advantages: No storage unit with ...

Added by **Lorik** on *Fri, 10 Sep 2021 10:33:56 +0300*

## Dynamic Programming Principle and LeetCode Solution

Catalog
Three characteristics of dynamic planning:
Dynamic Planning Solutions:
1. State Transition Table Method
2.State Transfer Equation Method
3.LeetCode Solutions
3.1 LeetCode 509.Fibonacci Number
3.2 LeetCode 70.Climb stairs
3.3 LeetCode 198.Raid homes and plunder houses
3.4 LeetCode 53.Maximum Subordinate Sum
3.5 LeetCode 152.Pro ...

Added by **mentalfloss** on *Fri, 10 Sep 2021 08:19:02 +0300*

## Infix to suffix calculation

preface
Infix expression is the expression we often use in addition, subtraction, multiplication and division. Suffix expression is a computer-friendly expression. The computer can use two stacks to calculate the input calculation string
Tip: the following is the main content of this ar ...

Added by **jrolands** on *Fri, 10 Sep 2021 03:25:11 +0300*

## [data structure and algorithm, explosion]

At this time, there are only two elements in the array, so we only need to constantly compare the sizes of child elements in the two elements to obtain a complete ordered array, as shown in the following figure:
This is a complete merging and sorting process. Next, let's implement it with code
function mergeSort(arr) {
// Combin ...

Added by **WLW** on *Fri, 10 Sep 2021 02:13:58 +0300*