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.
Yes, I can do that, but this is your task, right? Study binary search trees. You can build them either with arrays or with linked nodes. Post troublesome code here for help. Be sure and read the "Before you make a query" thread so you know how to post your code in code tags.
