V) A binary search tree is a tree where each node has at most two children, left and right. The root is the top, the left child is the "smaller" and the right child is the "larger" element. (You might re-read section 2.1 - this is at the very end of the section.) Consider the words: Cheddar, Swiss, Brie, Panela, Stilton, Mozzarella, Gouda A) Place the words (in the order they are given) in a binary search tree with "Cheddar" as the root and use the idea of alphabetizing as the ordering. B) What is the height of the tree? C) Create a binary search tree with minimum height using the words in any order you choose with any root you choose and use the idea of alphabetizing as the ordering. D) How will a tree with minimum height be useful?