Consider the following addNode method for inserting a newNode into a binary search tree: Which of the following sequences of insertions will result in a balanced tree? In each sequence, the first node inserted becomes the root of the tree on which the addNode method is called for the subsequent insertions.
i.12, 7, 25, 6, 9, 13, 44
II.12, 7, 25, 44, 13, 6, 9
III.12, 25, 44, 13, 6, 9, 7
A)I and II only
B)I only
C)II only
D)I and III only

Question

Consider the following addNode method for inserting a newNode into a binary search tree:  Which of the following sequences of insertions will result in a balanced tree? In each sequence, the first node inserted becomes the root of the tree on which the addNode method is called for the subsequent insertions.
i.12, 7, 25, 6, 9, 13, 44
II.12, 7, 25, 44, 13, 6, 9
III.12, 25, 44, 13, 6, 9, 7 
A)I and II only 
B)I only 
C)II only 
D)I and III only

Quizplus · Accepted Answer

The Answer of Consider the following addNode method for inserting a newNode into a binary search tree:  Which of the following sequences of insertions will result in a balanced tree? In each sequence, the first node inserted becomes the root of the tree on which the addNode method is called for the subsequent insertions.
i.12, 7, 25, 6, 9, 13, 44
II.12, 7, 25, 44, 13, 6, 9
III.12, 25, 44, 13, 6, 9, 7 
A)I and II only 
B)I only 
C)II only 
D)I and III only

Consider the Following AddNode Method for Inserting a NewNode into a Binary