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 Node class?
I root
II left
III right
A) I
B) II and III
C) I and II
D) I, II and III

Question

Quizplus · Accepted Answer

In a binary search tree, each node must have references to its left and right children to maintain the tree structure. The root is not an instance variable of a node but rather a reference to the top node of the tree in the tree class.

A Binary Search Tree Is Made Up of a Collection