Multiple Choice
A binary search tree is made up of a collection of nodes organized with smaller data values on the left and greater values on the right, relative to any node. Which of the following Node references must be instance variables of any implementation of a BinarySearchTree class?
I root
II left
III right
A) I
B) II and III
C) I and II
D) I, II and III
Correct Answer:

Verified
Correct Answer:
Verified
Q100: Given the MinHeap class discussed in section
Q101: Which of the following is NOT a
Q102: Consider the following tree diagrams: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q103: Consider the following binary search tree diagram:
Q104: Consider the following binary search tree diagram:
Q105: A binary tree of height h can
Q106: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q108: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q109: Which of the following statements about binary
Q110: Given the Visitor interface discussed in section