6/7/2021 Unit4 Quiz: Attempt review

Dashboard /
Courses /
SY B.Tech Computer Engineering (Sem II) /
DM(Div-A) /
Unit 4 Trees /
Unit4 Quiz

Started on Wednesday, 5 May 2021, 12:39 PM

State Finished
Completed on Wednesday, 5 May 2021, 12:52 PM
Time taken 12 mins 19 secs
Grade 10.00 out of 10.00 (100%)

Question 1 The difference between the external path length and the internal path length of a binary tree with n internal
Correct nodes is?

Mark 1.00 out of

1.00 Select one:
A. 2n 

B. n+1

C. n

D. 1

Your answer is correct.

The correct answer is: 2n

Question 2 Which of the following traversal outputs the data in sorted order in BST?
Correct

Mark 1.00 out of Select one:

1.00
A. Inorder 

B. Level order

C. Post order

D. Preorder

Your answer is correct.

The correct answer is: Inorder

Question 3 The no of external nodes in a full binary tree with n internal nodes is?

Correct

Mark 1.00 out of Select one:

1.00
A. 2n

B. 2n+1

C. n+1 

D. n

Your answer is correct.

The correct answer is: n+1

54.147.11.221/comp/mod/quiz/review.php?attempt=11080&cmid=5198 1/3
6/7/2021 Unit4 Quiz: Attempt review

Question 4 The number of edges from the root to the node is called __________ of the tree.

Correct

Mark 1.00 out of Select one:

1.00
A. Height

B. Depth 

C. Length

D. Width

Your answer is correct.

The correct answer is: Depth

Question 5 The number of edges from the node to the deepest leaf is called _________ of the tree.

Correct

Mark 1.00 out of Select one:

1.00
A. Depth

B. Height 

C. Length

D. Width

Your answer is correct.

The correct answer is: Height

Question 6 What is full binary tree?

Correct

Mark 1.00 out of Select one:

1.00
A. All the leaves are at same level

B. Each node has exactly zero or two children 

C. Each node has exactly one or two children

D. Each node has exactly 2 children

Your answer is correct.

The correct answer is: Each node has exactly zero or two children

Question 7 In a full binary tree if number of internal nodes is l then number of leaves L are
Correct

Mark 1.00 out of Select one:

1.00
A. L=L-1

B. L=2*l

C. L=l+1 

D. l

Your answer is correct.

The correct answer is: L=l+1

54.147.11.221/comp/mod/quiz/review.php?attempt=11080&cmid=5198 2/3
6/7/2021 Unit4 Quiz: Attempt review

Question 8 How many distinct binary search trees can be created out of 4 distinct keys?
Correct

Mark 1.00 out of Select one:

1.00
A. 4

B. 24

C. 42

D. 14 

Your answer is correct.

The correct answer is: 14

Question 9 Which of the following is not an advantage of tree

Correct

Mark 1.00 out of Select one:

1.00
A. Hierarchical structure

B. Undo operation in notepad 

C. Faster search

D. Router algorithms

Your answer is correct.

The correct answer is: Undo operation in notepad

Question 10 In a full binary tree if there are L leaves then total number of nodes  N are
Correct

Mark 1.00 out of Select one:

1.00
A. N=2*L+1 

B. N=2*L

C. N=L+1

D. N=L-1

Your answer is correct.

The correct answer is: N=2*L+1

◄ DM unit 4 Jump to... Unit 5 Notes ►

54.147.11.221/comp/mod/quiz/review.php?attempt=11080&cmid=5198 3/3