Algorithms and Data Structures Flashcards

1
Q

BST: How is Breadth First Traversal implemented?

A

With a queue.

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

BST: How is Depth First Traversal implemented?

A

With recursion.

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

What is pre-order traversal?

A

A form of Depth First Search of a BST.
Order is:
parent - left - right

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

What is in-order traversal?

A

A form of Depth First Search of a BST.
Order is:
left - parent - right

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

What is post-order traversal?

A

A form of Depth First Search of a BST.
Order is:
left - right -parent

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