def dfs(rot):
    stack = [];
    stack.append(rot)
    depth = 0;
    node = rot

    while True:
        print("Going to node %s, depth: %s" % (noder.index(node), depth))
        if node.ratatosk:
            return depth

        if node.barn != None:
            for n in node.barn:
                stack.append(n)
            #increase depth if node has no children, how to decrease?
            depth+=1

        #change node to last in stack
        next = stack.pop()

        node = next