Topic: Data Structure Implementation & Analysis (C++)

2. Suppose we had a binary search tree where each node's value is a letter of the alphabet, and the comparison between two letters is based on alphabetical order. Recall that the relevant portion of alphabetical order, smallest to largest, is ABCDEFGHI- JKLM How many such binary search trees do we have that obey all of the following properties? The tree's valies consists of only the letters A through M, inclusive (thirteen letters total). Each of these letters appears exactly once in the tree. The root node of the tree is the letter "J' The root's left hand child is the letter 'E' Be sure to explain how you got your answer. Hint: Draw out, as generally as you can, what every tree that meets these requirements looks like