Interview Question

Software Development Engineer Interview Seattle, WA

make a function that counts the number of nodes in a tree

Answer

Interview Answer

3 Answers

0

use a queue

Interview Candidate on Jan 13, 2013
3

Use recursion, it's the best at problems like this! Think of the problem in these terms:

1.) An empty tree has 0 nodes
2.) Any other tree has one root node, plus however many nodes are in the left and right sub-trees.

Now think of how to put that into code.

Anonymous on Jan 15, 2013
0

A non-recursive approach is to perform a breadth-first traversal and and count the nodes as you visit them.

Specifically, suppose we have a class of type Node that contains two fields, called left and right, both of type Node. Let root (of type Node) be the root of the tree. Here's the code, which you would invoke with the call: nNodes = countNodes( root );

public int countNodes( Node node ) {
    int count = 0;
    Queue<Node> q = new LinkedList<Node>();
    if ( node != null ) {
        q.add( node );
    }
    while ( !q.isEmpty() ) {
        count += 1;
        Node traveler = q.remove();
        if ( traveler.left != null ) {
            q.add( traveler.left );
        }
        if ( traveler.right != null ) {
            q.add( traveler.right );
        }
    }
    return count;
}

Hope this is useful!

Peter JL on Mar 3, 2013

Add Answers or Comments

To comment on this question, Sign In with Facebook or Sign Up