Write a program to process a BST whose nodes contain characters. The user should be allowed to select from the following menu of options:
I followed by a character: To insert a character
S followed by a character: To search for a character TI: for inorder traversal
TP: for preorder traversal
TR: for postorder traversal
QU: to quit