Gra 8.00 out of 10.00 de (80%) ???? Question 1 Question text A leaf is any node that: Question 1 Select one: a. Has one child b. Is an internal node with no ancestors C. Is any node with two empty children d. Is the ancestor of the root node Feedback The correct answer is: Is any node with two empty children Question 2 Question text 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" Question 2 Select one: True False Feedback The correct answer is 'False'. Question 3 Question text The process for visiting all of the nodes of a binary tree in some order is called a traversal. Question 3 Select one:
True False Feedback The correct answer is 'True'. Question 4 Question text A full binary tree has a restricted shape which starts at the root and fills the tree by levels from left to right. Question 4 Select one: True False Feedback The correct answer is 'False'. Question 5 Question text A binary tree traversal that lists every node in the tree exactly once is called: Question 5 Select one: a. a Traversal b. A visitor design pattern c. An enumeration d. Natural ordering sequence Feedback The correct answer is: An enumeration Question 6 Question text
A preorder traversal visits every node starting at the leaf nodes and working up the tree. Question 6 Select one: True False Feedback The correct answer is 'False'. Question 7 Question text Correctly identify the following heap structure by selecting the best answer: Question 7 Select one: a. partially ordered heap b. max-heap structure C. priority heap d. min-heap structure Feedback The correct answer is: max-heap structure Question 8 Question text