Please help me with these, thank you! 3. **25.3 (Implement inorder traversal without using recursion) Implement…

Please help me with these, thank you!

3. **25.3 (Implement inorder traversal without using recursion) 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. 4. **25.4 (Implement preorder traversal without using recursion) 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 5. *25.5 (Implement postorder traversal without using recursion) 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. 6. *25.6 (Find the leaves) Add a method in the BST class to return the number of the leaves as follows: /** Return the number of leaf nodes */ public int getNumberOf Leaves() 7. **25.7 (Find the nonleaves) Add a method in the BST class to return the number of the nonleaves as follows: /** Return the number of nonleaf nodes */ public int getNumberofNonLeaves(