Describe the differences in Tree implementations using arrays and pointers!

Simple JAVA stack code implementation please help in any part you can, please be clear, thank you Given an interface for Stack- Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of Stack interface provided- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Get on the bus – Stack (lifo)- Implement the provided Stack interface ( fill out the implementation shell)- Put your implementation through its paces by exercising each of the methods ina test harness- Add to your ‘BusClient’ the following functionality using your Stack-o Create (push) 6 riders by name§ Iterate over the stack, print all riderso Peek at the stack / print the resulto Remove (pop) the top of the stack§ Iterate over the stack, print all riderso Peek at the stack / print the resulto Add two more riders to the stacko Peek at the stack & print the resulto Remove all riders from…

Describe the key distinctions that exist between constrained and unbounded stack implementations.

C++ language only pls implement a binary tree and multi-child tree that can use a generic data type. and make sure that it can be traverse the tree and can access the children nodes thanks! CODE ONLY ON C++