Write a method for the class Binary Tree that returns the depth of the shallowest leaf in the tree. That is, among all leaves, you need to return the smallest depth of a leaf. What is the running time of your algorithm Explain your algorithm and running time.

public int depthOfShallowestLeaf()

{

}