Multiple Choice
Consider the operation of deleting the root of a binary search tree.If the root is a leaf,then
A) the method doing the deletion should throw an exception
B) the root should be replaced with a dummy place-holder node
C) the reference to the root of the tree should be set to null
D) the element stored in the root node should be replaced with null,or with 0.
Correct Answer:

Verified
Correct Answer:
Verified
Q5: A sorting algorithm based on a priority
Q6: The length of the longest path from
Q7: Consider the operation of deleting the root
Q8: Assuming a Node class<br>class Node<br>{<br>int element;<br>Node left,right;<br>Node(int
Q9: A complete binary tree with N nodes
Q11: A binary tree traversal method that recursively
Q12: A binary tree with no root<br>A) must
Q13: Postorder traversal of a binary tree<br>A) first
Q14: Let X be a node in a
Q15: The level of a node X in