BINARY SEARCH TREE EASY

1. Suppose a binary search tree property is that each nodes 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 ABCDEFGHIJKLM

   How many such binary search trees do we have that obey all of the following properties?

   • The trees values 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 roots left hand child is the letter E

     Explain the answer and give the visualization