Is anybody has solution for this problem in C

Given a sequence of lowercase alphabetic strings, insert them in a binary search tree. Output the inorder, preorder and postorder traversals of the tree. The output should be in uppercase.