Test the function 1eafCount 0 from Exercise. Generate binary trees using the function generate BSTO in Problemm display them using di splay Preorder () (see Exercise 21), and then count the leaves using leaf Count ().
Exercise,
Write a recursive function member 1eafCountO for class template BST to count the leaves in a binary tree. (Hint: How is the number of leaves in the entire tree related to the number of leaves in the left and right sub trees of the root?)
Problem
Write a definition for the following function generate BSTO for generating a binary search tree containing uppercase letters inserted in a random order:
