Unit4 Quiz - Attempt Review
Unit4 Quiz - Attempt Review
Unit4 Quiz - Attempt Review
Dashboard /
Courses /
SY B.Tech Computer Engineering (Sem II) /
DM(Div-A) /
Unit 4 Trees /
Unit4 Quiz
Question 1 The difference between the external path length and the internal path length of a binary tree with n internal
Correct nodes is?
B. n+1
C. n
D. 1
Question 2 Which of the following traversal outputs the data in sorted order in BST?
Correct
B. Level order
C. Post order
D. Preorder
Question 3 The no of external nodes in a full binary tree with n internal nodes is?
Correct
B. 2n+1
C. n+1
D. n
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
B. Depth
C. Length
D. Width
Question 5 The number of edges from the node to the deepest leaf is called _________ of the tree.
Correct
B. Height
C. Length
D. Width
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
B. L=2*l
C. L=l+1
D. l
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
B. 24
C. 42
D. 14
C. Faster search
D. Router algorithms
Question 10 In a full binary tree if there are L leaves then total number of nodes N are
Correct
B. N=2*L
C. N=L+1
D. N=L-1
54.147.11.221/comp/mod/quiz/review.php?attempt=11080&cmid=5198 3/3