BINARY SEARCH TREE C++

1. the definition of a binary search tree: a binary tree is a binary search tree if:

   • It is null

   • It is not null, has a value, and:

     The left-hand child is a binary search tree, all of whose values are less than this nodes value.

     The right-hand child is a binary search tree, all of whose values are greater than this nodes value.

   1. (a) There are five possible binary search trees (down to isomorphism) with three nodes. Draw them.

   2. (b) There is only possible binary search tree of size one (one vertex), there are two of size two, five of size three, and 14 of size four. Use this information to determine how many binary search trees of size five are possible.