Remarks: In all algorithm, always explain how and why they work. ALWAYS, analyze the complexity of your algorithms. In all algorithms, always try to get the fastest possible. A correct algorithm with slow running time may not get full credit. In all data structures, try to minimize as much as possible the running time of any operation.

no code please :)

We are given a tree of height larger than h. Write an algorithm that find a tree rooted by some element that has height h. Among all such trees return the one with the largest amount of elements.