Finding maximum depth of a tree

Question

I know how to find the depth of a binary tree. But I cannot generalize it to work for any tree.

Can someone please outline a pseudo code for finding the depth of a tree (not necessarily a binary tree).

Answer 1

int findDepthOfTree(tree):
    int deepest = 0;
    for (child of root node)
       deepest = max(deepest, findDepthOfTree(child))
    return deepest + 1

Answer 2

Java implementation to find depth of a k-ary tree:

static int findDepth(Node root) {
    int deepest = 0;
    if (root.children != null) {
        for (Node child : root.children) {
            deepest = Math.max(deepest, findDepth(child));
        }
    }
    return deepest+1;
}

This assumes the following Node class is implemented to hava a data element as well as a reference to the list of nodes representing its children. Would be something like this:

class Node {
    int data;
    List<Node> children;

    public Node (int data, List<Node> children) {
        this.data = data;
        this.children = children;
    }
    public Node (int data) {
        this.data = data;
        this.children = null;
    }
}