Multiple Choice
Suppose a binary tree is implemented as a linked structure in which each node contains both a left child pointer and a right child pointer. Which of the following statements is false?
A) The number of nodes in the tree is always at least the number of nodes on the longest path in the tree.
B) The number of NIL pointers in the tree is always greater than the number of nodes in the tree.
C) Each terminal node in the tree is always at the end of a path that is as least as long as any other path in the tree.
D) Both the left child and right child pointers of every terminal node are NIL.
Correct Answer:
Verified
Correct Answer:
Verified
Q7: Suppose a binary tree contained the nodes
Q10: If a queue contained the entries w,x,y,z
Q16: The table below represents a portion of
Q20: What is the distinction between direct addressing
Q23: If the longest path in a binary
Q24: Define each of the following:<br>A. Primitive data
Q26: If the variable named Box had the
Q35: Which of the following is static in
Q45: If a stack contained the entries w,x,y,z
Q51: What condition indicates that a linked list