Trees

Question 1

Are inorder, preorder, and postorder classed as depth-first search, or breadth first search?

Answer 1

Depth-first search

Question 2

What kind of traversal is used to delete the tree?

Answer 2

Postorder

Question 3

Postorder traversal is used to get the _________ expression of an expression tree.

Answer 3

Postfix

Question 4

Preorder traversal is used to get the _________ expression of an expression tree.

Answer 4

prefix

Question 5

Postorder traversal can help in ________ collection algorithms, particularly in systems where _____________ is used.

Answer 5

garbage; manual memory management

Question 6

What order are nodes visited in POSTORDER traversal?

Answer 6

left, right, root

Question 7

What order are nodes visited in PREORDER traversal?

Answer 7

root, left, right

Question 8

What order are nodes visited in INORDER traversal?

Answer 8

left, root, right

Question 9

What kind of traversal is used to create a copy of a tree?

Answer 9

Preorder

Question 10

Inorder traversal gives nodes in ___________ order.

Answer 10

non-decreasing order

Question 11

When REVERSED, Inorder traversal gives nodes in ___________ order.

Answer 11

non-increasing

Question 12

A tree with n nodes has _______ links/edges.

Answer 12

n-1

Question 13

A tree is a(n) __________ and _________ graph.

Answer 13

undirected; acyclic
(no cycles or loops, every node can be the root node of its own subtree)

Question 14

What is the level/depth of a tree?

Answer 14

Number of edges along the unique path between a node and the root node

Question 15

The height of the root node is automatically the _________________________________________________

Answer 15

height of the entire tree itself