Data Structure & Algorithms Flashcards by Shaun Wang

Q

In-order Tree Traversal

A

Inorder = BAC

Left → Up → Right

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Preorder Tree Traversal

A

Preorder = ABC

Up → left → Right

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Postorder Tree Traversal

A

Postorder = BCA

Left → Right → Up

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Preorder Tree Traversal

(Algorithm)

A

Appends before traversing left and right

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Inorder Tree Traversal

(Algorithm)

A

Appends after traversing left

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Postorder Tree Traversal

(Algorithm)

A

After traversing all of the nodes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly