Multiple Choice
What does the left node reference of a newly inserted binary search tree node get set to?
A) depends where the node is inserted
B) it gets set to the left child of the new node, if one exists
C) always null
D) it gets set to the left child of the root, if it exists
Correct Answer:

Verified
Correct Answer:
Verified
Q45: You are using a tree to show
Q46: You wish to traverse a binary search
Q47: What is the efficiency of the heapsort
Q48: Which of the following statements about the
Q49: Which of the following sequences of insertions
Q51: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q52: Adding an element to a balanced binary
Q53: Consider the following binary search tree: <img
Q55: Consider the following tree diagram: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB7390/.jpg"
Q60: The height h of a completely filled