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
Q3: Which of the following is a LIFO
Q4: If a stack contained the entries w,x,y,z
Q5: The table below represents a portion of
Q6: Suppose a binary tree contained the nodes
Q7: The table below represents a portion of
Q9: If a queue contained the entries w,x,y,z
Q10: Which of the following is not a
Q11: Suppose you were going to retrieve items
Q18: If the longest path in a binary
Q36: In a machine language,the technique in which
Unlock this Answer For Free Now!
View this answer and more for free by performing one of the following actions
Scan the QR code to install the App and get 2 free unlocks
Unlock quizzes for free by uploading documents