Consider the operation of deleting the root of a binary search tree. If the root has two children, then
A) the root node should be removed, then the least node in the right subtree should be deleted and used to replace the root
B) the rood node should be removed, and the deepest rightmost leaf should be used to replace the root
C) the rood node should be removed, the deepest rightmost leaf should be used to replace the root, and then a sift down should be performed to take the root replacement to its proper place
D) the operation should be recursively performed on the two subtrees of the root.
A) the root node should be removed, then the least node in the right subtree should be deleted and used to replace the root
You might also like to view...
The __________ of two numbers is the largest integer that divides both numbers.
A) ?greatest common divisor ? B) ?prime polynomial C) ?lowest common divisor ? D) ?integral divisor
The LINQ _______ clause is used for filtering.
Fill in the blank(s) with the appropriate word(s).
________ view gives you an easy way to resize fields and check form appearance while you are creating the form
Fill in the blank(s) with correct word
In small animations, the number of frames varies, but commonly includes from ____ frames.
A. 5 to 50 B. 10 to 100 C. 25 to 250 D. 50 to 500