A binary search is to be traversed systematically so that all its stored values can be printed. The traversal algorithm is to visit each node exactly once. Which traversal pattern, when applied recursively to nodes starting at the root, results in a listing of values in descending order of magnitude?

A right chid - left child -- parent

B.parent -- left child -- right child

C.right child -- parent -- left child

D.left child -- parent -- right child

When value 27 is removed from the binary search tree shown, the following procedure will result in a new tree which its binary search tree property restored.

A. 31 takes the place of 27, and the subtree rooted in 35 becomes the left subtree of 46,

B. 32 takes the place of 27, and leaf 32 is deleted.

C. Both B and have the desired effect, but B yields the preferred tree structure,

D. Both B and have the desired effect, but yields the preferred treo structure E 16 takes the place of 27, and leaf 16 in deleted.