Question 1

The simulated link strategy does not allow array positions to be allocated contiguously regardless of the completeness of the tree.

Accepted Answer

A) True 
 B)False

Question 2

The simulated link strategy allows array positions to be allocated contiguously regardless of the _________ of the tree.

Accepted Answer

A)  size 
B)  order 
C)  completeness 
D)  root

Question 3

What are the advantages and disadvantages of the computational strategy?

Accepted Answer

The answer of What are the advantages and disadvantages of...

Question 4

Preorder traversal means visit the left child, then the right child, then the node.

Accepted Answer

A) True 
 B)False

Question 5

In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.

Accepted Answer

A)  2n + 1 
B)  2n + 2 
C)  2(n + 1) 
D)  A and B 
E)  A and C
F) B and C

Question 6

A collection where each node can have from 0 to 2 children is called a ___________.

Accepted Answer

A)  Stack 
B)  Queue 
C)  List 
D)  Binary tree

Question 7

-A ______ is a nonlinear structure whose elements are organized into a hierarchy.

Accepted Answer

The answer of 
-A ______ is a nonlinear structure whose...

Question 8

-There are four basic methods for traversing a tree: ______.

Accepted Answer

The answer of 
-There are four basic methods for traversing...

Question 9

A collection where each node can have from 0 to 3 children is called a Binary Tree.

Accepted Answer

A) True 
 B)False

Question 10

-The ______ strategy allows array positions to be allocated contiguously regardless of the completeness of the tree.

Accepted Answer

The answer of 
-The ______ strategy allows array positions to...

Question 11

The binary tree shown above is balanced.

Accepted Answer

A) True 
 B)False

Question 12

Define the height of a tree.

Accepted Answer

The answer of Define the height of a tree....

Question 13

In general, a balanced n-ary tree with m elements will have height lognm.

Accepted Answer

A) True 
 B)False

Question 14

Level-order traversal means visit the nodes at each level, one level at at time, starting with the root.

Accepted Answer

A) True 
 B)False

Question 15

A node that does not have a ______ is called the root of a tree.

Accepted Answer

The answer of A node that does not have a...

Question 16

_________ traversal means visit the node, then the left child, then the right child.

Accepted Answer

A)  preorder 
B)  postorder 
C)  inorder 
D)  level-order

Question 17

In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.

Accepted Answer

A) True 
 B)False

Question 18

Define the level of a node.

Accepted Answer

The answer of Define the level of a node....

Question 19

A node that has both a parent and at least one child is called a(n) ______ node.

Accepted Answer

The answer of A node that has both a parent...

Question 20

A tree is a nonlinear structure whose elements are organized into a __________.

Accepted Answer

A)  stack 
B)  hierarchy 
C)  queue 
D)  list

Exam 9: Searching and Sorting

The simulated link strategy does not allow array positions to be allocated contiguously regardless of the completeness of the tree.

The simulated link strategy allows array positions to be allocated contiguously regardless of the _________ of the tree.

What are the advantages and disadvantages of the computational strategy?

Preorder traversal means visit the left child, then the right child, then the node.

In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.

A collection where each node can have from 0 to 2 children is called a ___________.

-A ______ is a nonlinear structure whose elements are organized into a hierarchy.

-There are four basic methods for traversing a tree: ______.

A collection where each node can have from 0 to 3 children is called a Binary Tree.

-The ______ strategy allows array positions to be allocated contiguously regardless of the completeness of the tree.

The binary tree shown above is balanced.

Define the height of a tree.

In general, a balanced n-ary tree with m elements will have height log_nm.

Level-order traversal means visit the nodes at each level, one level at at time, starting with the root.

A node that does not have a ______ is called the root of a tree.

_________ traversal means visit the node, then the left child, then the right child.

In the computational strategy to implement a tree with an array, the children of node n are stored at 2n + 1 and 2(n + 1) respectively.

Define the level of a node.

A node that has both a parent and at least one child is called a(n) ______ node.

A tree is a nonlinear structure whose elements are organized into a __________.