Trees Flashcards

1
Q

Tree Abstract Base Class Implementation - 1

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

Tree Abstract Base Class Implementation - 2

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

Tree abstract base class - private height method(bad)

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

Tree abstract base class - private height method(good)

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

Tree abstract base class - public height method

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

Binary Tree abstract base class

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

Linked Binary Tree Implementation - 1

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

Linked Binary Tree Implementation - 2

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

Linked Binary Tree Implementation - 3

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

Linked Binary Tree Implementation - 4

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

Pre-order Traversal Intro

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

Post-order Traversal Intro

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

Breadth First Traversal Intro

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

In-order Traversal Intro

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

In-order Traversal Implementation - 1

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

In-order Traversal Implementation - 2

17
Q

Pre-order Traversal Implementation - 1

18
Q

Pre-order Traversal Implementation - 2

19
Q

Pre-order Traversal Implementation - 3

20
Q

Post-order Traversal Implementatin - 1

21
Q

Node Implementation - GFG

22
Q

In Order Traversal Implementation - GFG

23
Q

Pre Order Traversal Implementation - GFG

24
Q

Post Order Traversal Implementation - GFG

25
Q

Breath First Traveresal Implementation

26
Q

Binary Tree ADT Methods