Dashboard / My courses / CS 3303-01 - AY2022-T5 / 7 July - 13 July / Self-Quiz Unit 4
Started on Sunday, 10 July 2022, 12:20 AM State Finished Completed on Sunday, 10 July 2022, 12:30 AM Time taken 9 mins 32 secs Grade 10.00 out of 10.00 (100%)
Question 1 Correct
Mark 1.00 out of 1.00
A leaf is any node that:
Select one: O a. Has one child O b. Is an internal node with no ancestors O c. Is any node with two empty children O d. Is the ancestor of the root node
The correct answer is: Is any node with two empty children
Question 2 Correct Mark 1.00 out of 1.00
The full binary tree theorem states"the number of leaves in an empty full binary tree is one more than the number of internal nodes"
Select one: Drrre
O False v
The correct answer is 'False'.
Question 3 Correct Mark 1.00 out of 1.00
The process for visiting all of the nodes of a binary tree in some order is called a traversal.
Select one:
O True v
O False
The correct answer is 'True'.
Question 4 Correct Mark 1.00 out of 1.00
A full binary tree has a restricted shape which starts at the root and fills the tree by levels from left to right.
Select one: O True O False v
The correct answer is 'False'.
Question 5 Correct Mark 1.00 out of 1.00
A binary tree traversal that lists every node in the tree exactly once is called:
Select one: O a. a Traversal O b. A visitor design pattern O c. An enumeration O d. Natural ordering sequence
The correct answer is: An enumeration
Question 6 Correct Mark 1.00 out of 1.00
A preorder traversal visits every node starting at the leaf nodes and working up the tree.
Select one: O True
O False v
The correct answer is'False'.
Question 7 Correct Mark 1.00 out of 1.00
Correctly identify the following heap structure by selecting the best answer:
100
Select one: O a. partially ordered heap O b. max-heap structure O c. priority heap O d.min-heap structure
The correct answer is: max-heap s