Linked List 链表代码实现 Flashcards

1
Q

->的两种作用

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

链表代码规范:头节点插入

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

实现链表打印的完整代码

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

链表在任意位置插入节点函数的原理

A

1.获得原来第n个节点的地址2.产生新的第n个节点

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

链表在任意位置插入节点函数的代码示范

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

使用递归Print 函数代码实现

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Insert 函数代码(尾插法)

A

传入函数的参数有误,应该是:**

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Reverse 函数代码规范

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Reverse Print函数代码规范

A

To summarize, the return statement is responsible for unwinding the recursion, allowing the program to move back to previous nodes and print the data of each node in reverse order.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Reverse (using recursion)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Double List Node

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Double list insert function

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Double Linked List : Insert (pseudocode )

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Double Linked List : Delete (pseudocode )

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

一些概念:(随便看看)

A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

链表 尾插法:代码规范(使用for循环,需要输入有多少个节点)

A
17
Q

链表 : 删除 (pseudocode)

A
18
Q

链表 o( )时间分析:

A
19
Q

双向链表 :合并(pseudocode)

A
20
Q

链表代码规范:查找含有最大值的节点

A