Reference no: EM13311296

I have a small short homework assignment. For my homework I have to do 4 short answer questions. I do not need the whole program at all THIS IS NOT 4 PROJECTS. All I need to do is develop 4 methods from four separate ALREADY MADE CLASSES from old projects my instructor developed for us to use for today.NOTHING AT ALL NEEDS to be complied I do not need a java file(s) or substantial development sent back to me, under no circumstance do I need projects sent back to me this is not project development. I need four METHODS developed sent back to me on a word document listed 1-4 for each question that meets the basic requirement for each one. More or less these are handpicked text book questions my instructor is giving to us today from 4 separate sections. Please do not be confused I again am repeating it this is not 4 projects this is literally four short answer METHODS that should be written onto a word document and sent to me.

All Files are in zip files

1.) Design a method from "Stack" Class to reverse the order of members in a stack. (Stack Order: From 1234 to 4321). No array. (allowed example : push,pop). File Name : Stack
2) Design a method from the "Queue" class to "enQueue" to the front end of a queue (No Array). File Name: queues
3.) Design a method from the "BinarySearchTree" Class to count the number of members in a binary search tree. (Traversal) (No array). Zip File Has both Binary search tree and Binary Tree. File Name : BST
4.) Design a method from the "CompleteTree" class to determine if a complete tree is also a full tree. (Textbook Hint: Count number of nodes). (No Array) File name: CompleteTree

Attachment:- ASSIGNMENT.rar