Insert into the first one after L

Insert to the end of the table

Tail pointer points to head pointer

Each node has two pointers, one pointing forward and one pointing backward.

When inserting and deleting, two pointers of a node need to be changed.

ginseng

Three fields, coefficient, exponent, pointer

suffix

It can be assumed that the outermost circle is filled with walls

and non-recursive can be converted into each other

Writing method

static

dynamic

Check if there are many

Retrieve various attributes

Search collectively

insert

delete

summary

host

Second-rate

∑Pi×Ci C is the number of comparisons when finding the element

Simple and widely applicable

Large ASL, low efficiency

binary decision tree

That is, the sequence table is divided into blocks, and the index table stores the maximum value of each block. The starting position of the big keyword and the first keyword, the index The table is also an ordered list

sequential search

half search

degree

Out degree 0D

Indegree ID

path length

simple path

loop

Strongly connected graph

connected graph

rights of each side

Related to storage structure

Also delete arcs

first adjacent point

next neighbor

All 0s on the diagonal

Symmetric matrix

Undirected graph

A

B

C

D

E

Compare

move

Find

move back

insert

evaluate

half search

move back

insert

evaluate

Macro adjustment first, then micro adjustment

Its analysis is very complex

There are many algorithms

evaluate

Set up a pivot and move the smaller one to the left and the larger one to the right.

The more orderly the slower

unstable

evaluate

evaluate

O(nlog2↓n)

The number of white subtrees a node has

The maximum value of the node degree

Total number of nodes n=n0 n1 n2 Total number of branches B=n-1 B=n1 2*n2+ Leaf node n0=1 n2 2*n3

Even number has 1 node with degree 1

Divide the total by 2

The rest are those with degree 0

1

2

3

Fill it up with 〇 first, starting from the first level, from left to right, if you have it, save it, if there is no 〇 Right now 1A 2 B C 3 D E F ABCDE〇F〇0〇〇

Three data

Four data

The first one is A, the last one is the bottom right

The first one is the bottom left, the last one is the bottom right

The first one is the bottom left, and the last one is A

successively

First hit

Later, first, middle

The path length of the tree k

Apply for pointer vector space

Apply for temporary code storage space

put closing mark

Start coding

After editing, let the pointer record

Make up the next one

free temporary space

Find the address of the element in row i and column j in different matrices

i row j column

Save less, don’t save 0

Reduce meaningless operations

Easy to operate

Symmetric matrix

triangular matrix

diagonal matrix

triple transpose