Write a program that will allow you to enter at least ten letters
of your name into a binary search tree (BST). Example: Anne
Duvalier is entered as
DUVALIERANNE, all uppercase. The
program should then print out the contents of your BST using
preorder, inorder, and postorder traversals, labeling each
output by the proper traversal type. Recall the convention to
place any duplicate letter in the left subtree of that letter.
Use the following declarations.
Use your tree to figure out each traversal: