import math


def totalTreeStepsFinder(nt, sl):
    """totalTreeStepsFinder() takes a newickTree and a stepLength
    and finds the total number of steps in the entire tree.
    """
    numSteps = 0
    if nt is None:
        return int(numSteps)
    numSteps = math.ceil(nt.distance / sl)
    return int(numSteps + totalTreeStepsFinder(nt.right, sl) + totalTreeStepsFinder(nt.left, sl))