QUESTION 1 If both of the child references of a binary tree node are non-null, i

Question

QUESTION 1

If both of the child references of a binary tree node are non-null, it follows that the node must be ____.

a root node

a leaf node

a child node

an interior node

1 points   

QUESTION 2

Which of the following statements about binary trees is correct?

Each node in a binary tree has at least two child nodes.

Each node in a binary tree has at most two child nodes.

The number of child nodes for each node in a binary tree is any power of two.

If divided down the middle from top to bottom, a binary tree must be symmetrical.

1 points   

QUESTION 3

Consider the following tree diagram:

Which of the following nodes are leaf nodes?

C

B

H

B and H

1 points   

QUESTION 4

Consider the following tree diagram:

Which of the following nodes are parent nodes?

C

C and R

R and D

C, R, and D

1 points   

QUESTION 5

Consider the following binary search tree diagram:

Which of the following trees represents the correct result after inserting element T?

I

II

III

IV

1 points   

QUESTION 6

Consider the following tree diagram:

What is the height of this tree?

3

4

5

7

1 points   

QUESTION 7

What does the left node reference of a newly inserted binary search tree node get set to?

depends where the node is inserted

it gets set to the left child of the new node, if one exists

always null

it gets set to the left child of the root, if it exists

1 points   

QUESTION 8

What are the differences between preorder, postorder, and inorder traversals?

The order in which we visit the left and right subtrees

Preorder only visits the left subtree

Postorder only visits the right subtree

The order of the root visit

1 points   

QUESTION 9

Consider the following tree diagrams:

Which of the above are binary search trees?

I

II

I and II

Neither I nor II

1 points   

QUESTION 10

Consider the following tree diagram:

What is the height of this tree?

3

4

6

7

1 points   

QUESTION 11

Consider the following tree diagram:

Which of the following statements is NOT correct?

Nodes D and K form a subtree

Nodes H, M, and X form a subtree

Nodes R and N form a subtree

Nodes L and T form a subtree

1 points   

QUESTION 12

Consider the following tree diagrams:

Which are binary search trees?

I

II

I and II

Neither I nor II

1 points   

QUESTION 13

Consider the following binary search tree diagram:

Which nodes will be visited in order to insert the letter B into this tree?

H

H and D

H, D, and F

H, D, and A

1 points   

QUESTION 14

If the child references of a binary tree node are both null, the node is ____.

a root node

a leaf node

a parent node

an interior node

1 points   

QUESTION 15

Consider the following tree diagrams:

Which of these trees is considered to be balanced?

I

I and II

II and III

I and III

1 points   

QUESTION 16

Consider the following tree diagrams:

Which of these trees is considered to be unbalanced?

I

II

III

II and III

1 points   

QUESTION 17

Consider the following tree diagrams:

Which of the above are binary trees?

I

II

I and II

Neither I nor II

1 points   

QUESTION 18

Consider the following tree diagram:

Which of the following statements is NOT correct?

R is an ancestor of N

C is an ancestor of N

D is an ancestor of P

H is an ancestor of M

1 points   

QUESTION 19

Consider the following tree diagram:

Which of the following nodes are siblings?

D and U

H and M

D and B

L and T

1 points   

QUESTION 20

Which action(s) will invalidate a min-heap so that, it may no longer have the properties of a min-heap?

I change the value of the root node

II remove the lowest level, right-most node

III remove the lowest level, left-most node

III

I and II

II and III

I and III

a root node

a leaf node

a child node

an interior node

Explanation / Answer

for some of the ques image you have uploaded is not visible

so answering rest of the ques

QUESTION 1

If both of the child references of a binary tree node are non-null, it follows that the node must be

interior node.

QUESTION 2

Which of the following statements about binary trees is correct?

Each node in a binary tree has at least two child nodes.

Ques3 to ques 6 image is not visible

QUESTION 7

What does the left node reference of a newly inserted binary search tree node get set to?

always null

QUESTION 8

What are the differences between preorder, postorder, and inorder traversals?

the order in which we visit the left and right subtrees and The order of the root visit

ques 9 to ques 13 image is not visible

QUESTION 14

If the child references of a binary tree node are both null, the node is ____

leaf node

ques 15 to ques 19 image is not visible

QUESTION 20

Which action(s) will invalidate a min-heap so that, it may no longer have the properties of a min-heap?

I and III

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.