I wanna do this in java. Anyone help me.

Implement the inorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the inorder method to display the elements Implement the preorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the preorder method to display the elements Implement the postorder method in BST using a stack instead of recursion. Write a test program that prompts the user to enter 10 integers, stores them in a BST, and invokes the postorder method to display the elements. Add a method in the BST class to return the number of the leaves as follows * Returns the number of leaf nodes*/public int getNumberOfLeaves() Add a method in the BST class to return the number of the nonleaves as follows Returns the number of nonleaf nodes "(public int getNumberofNonLeaves0)