6.2 The union-find data structure Flashcards

1
Q

What operations (and runtimes) does the union-find data structure support

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

What does MakeUnionFind operation do (in terms of forests)

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

What does FindSet(x) operation do (unionfind - in terms of forests)

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

What does Union(xi , xj) do (union-find - in terms of forests)

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

How can unionfind degenerate into linked-lists and what is the solution

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

Prove this for union-find

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

Recall this

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

How does path compression work for union find

A

Each time findset is called, compress all vertices on path to point to root.

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