Question 1

Which traversal type guides visits to items in the tree from left to right through the levels of the tree?

Accepted Answer

A)   levelorder
B)   inorder
C)   preorder
D)   postorderE) None of the above
F) A) and C)

Question 2

Array-based binary trees are the easiest to define and implement.

Accepted Answer

A) True 
 B)False

Question 3

What is the formula for determining the number of nodes in a full binary tree where H is the height of the tree?

Accepted Answer

A)   2 H - 1 + 1
B)   2 H  + 1
C)   2 H + 1
D)   2 H + 1 - 1E) A) and B)
F) A) and C)

Question 4

A min-heap is a binary tree in which each node is less than or equal to both of its children.

Accepted Answer

A) True 
 B)False

Question 5

What is the number of nodes in a full binary tree with a height of 4?

Accepted Answer

A)   23
B)   19
C)   31
D)   47E) C) and D)
F) B) and C)

Question 6

In a tree, the root item has no parent item.

Accepted Answer

A) True 
 B)False

Question 7

A file system is similar to a binary search tree.

Accepted Answer

A) True 
 B)False

Question 8

Which is true about binary search trees?

Accepted Answer

A)   they cannot support logarithmic insertions
B)   they can support logarithmic searches
C)   they don't work well for sorted collections
D)   each node in the right subtree of a given node is less than that nodeE) All of the above
F) B) and D)

Question 9

What kind of tree would be useful in analyzing the syntax of a sentence?

Accepted Answer

A)   binary search tree
B)   sorting tree
C)   parse tree
D)   linear treeE) All of the above
F) None of the above

Question 10

Which type of binary tree traversal traverses the left subtree, traverses the right subtree, and then visits the root node?

Accepted Answer

A)   postorder traversal
B)   inorder traversal
C)   preorder traversal
D)   unordered traversalE) None of the above
F) B) and C)

Exam 10: Trees

Array-based binary trees are the easiest to define and implement.

Correct Answer
verified

A file system is similar to a binary search tree.

Correct Answer
verified

In a tree, the root item has no parent item.

Correct Answer
verified

What is the number of nodes in a full binary tree with a height of 4?

Correct Answer
verified

Which is true about binary search trees?

Correct Answer
verified

A min-heap is a binary tree in which each node is less than or equal to both of its children.

Correct Answer
verified

Which traversal type guides visits to items in the tree from left to right through the levels of the tree?

Correct Answer
verified

What kind of tree would be useful in analyzing the syntax of a sentence?

Correct Answer
verified

What is the formula for determining the number of nodes in a full binary tree where H is the height of the tree?

Correct Answer
verified

Which type of binary tree traversal traverses the left subtree, traverses the right subtree, and then visits the root node?

Correct Answer
verified

Exam 10: Trees

Array-based binary trees are the easiest to define and implement.

Correct AnswerverifiedShow Answer

A file system is similar to a binary search tree.

Correct AnswerverifiedShow Answer

In a tree, the root item has no parent item.

Correct AnswerverifiedShow Answer

What is the number of nodes in a full binary tree with a height of 4?

Correct AnswerverifiedShow Answer

Which is true about binary search trees?

Correct AnswerverifiedShow Answer

A min-heap is a binary tree in which each node is less than or equal to both of its children.

Correct AnswerverifiedShow Answer

Which traversal type guides visits to items in the tree from left to right through the levels of the tree?

Correct AnswerverifiedShow Answer

What kind of tree would be useful in analyzing the syntax of a sentence?

Correct AnswerverifiedShow Answer

What is the formula for determining the number of nodes in a full binary tree where H is the height of the tree?

Correct AnswerverifiedShow Answer

Which type of binary tree traversal traverses the left subtree, traverses the right subtree, and then visits the root node?

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified