期末复习 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
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

选择题.选择排序

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

判断题.树的判断题(一次做一两题)

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

选择题.数据结构是什么?

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

选择题.语句出现的频度

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

选择题.关键路径是什么?

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

选择题. Dijkstra Algorithm

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

题目. 做快速排序的步骤是什么?

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

题目. 如何做快速排序?

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

题目. 如何由遍历构造二叉树?

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

题目. Hoffman Tree

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

题目.希尔排序 Shell Sort

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

题目. Bubble Sort 冒泡排序

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

题目. Merge Sort 归并排序

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

代码题总结:考链表、二叉树

20
Q

Link List : Reverse

21
Q

求二叉树高度的函数要怎么写?

22
Q

题目 . 二叉树转换森林

23
Q

题目. 树、二叉树怎么互相转换?

24
Q

题目 . 构造哈夫曼树

25
Q

题目 . 图的存储结构和遍历分别是什么?

26
Q

题目. 关键路径怎么计算?

27
Q

题目. 线性散列表探测法要怎么排序?

28
Q

题目 . 什么是二叉查找树?

29
Q

题目 . 已知无向图边数,至少有多少个顶点?

30
Q

Dijkstra Algorithm 手算的详细过程 :

31
Q

Dijkstra Algorithm 简单的手算步骤是什么?

32
Q

Floyd Algorithm 简单的手算步骤是什么?

33
Q

树的类型总结 :

34
Q

二叉树有什么性质?

满二叉树、完全二叉树有什么性质?

35
Q

线索二叉树的做题步骤是什么?

36
Q

题目 . 线索二叉树怎么做?

37
Q

How to merge 2 Link List?

38
Q

How to split a link list ?

39
Q

How to reverse a link list ?

40
Q

How to delete nodes with value greater than K in Link List ?

41
Q

How to delete nodes in List A with value equal to that in List B ?

42
Q

How to find the intersection of 2 Link List ?

43
Q

How to find the difference set of 2 Link List ?

44
Q

How to implement level_order traversal :

45
Q

How to count the nunber of leave nodes :

46
Q

How to count the number of nodes :

47
Q

How to count the number of nodes in k th level :