Im trying to print all values and depth for each node of my binary search tree. Im having trouble coming up with a way to count the depth recursively. So far I have a method for
