Need people to help me write code using stack for BST.

I have finished about 3/4 of my program and I need someone who can write me the following program below. All print must use Stack. No Recursion. Print the word tree in pre-order (Root-L-R) Print the frequency tree in post-order(L-R-Root) Print the frequency tree Print indented tree Search BSTs: Two searches are required: • In a loop prompt the user to enter a word and search for that word; if found print both counters. Stop when the user enters #. • Write another loop to prompt the user to enter a number (such as 4) and display all words with the same counter. Stop when the user enters –1 No memory leak. The textfile input is with me, and more instruction will be given along with the textfile input. The max I can go is $50. Thanks