solve these questions and show me the number of each answer

1.Describe an algorithm for deciding whether two binary trees have the same shape.

2.Suppose you are stranded on a desert island on which LIFO stacks are plentiful, but no other data structures (arrays, lists, sets, maps, etc.) exist. You need a FIFO queue. How can you implement a queue using two stacks? Describe each of the queue operations (isEmpty, enqueue, dequeue, and peek) in terms of the stack operations (isEmpty, push, pop, and peek). Your answer can be in the form of algorithms or Java methods.