Find the height of a binary tree

Question

Lucas · Accepted Answer

The above post gives too big of an answer except in trees that are technically Linked Lists.

Replace the return line with the following to *actually* get the height of a tree:
    return 1 + max(heightOfTree(node.left), heightOfTree(node.right));

Also, the above function could possibly terminate without returning anything. Add an else condition that returns 0 as the base case.

Anonymous · Answer

/** 
 Returns the max root-to-leaf depth of the tree. 
 Uses a recursive helper that recurs down to find 
 the max depth. 
*/ 
public int maxDepth() { 
  return(maxDepth(root)); 
}
private int maxDepth(Node node) { 
  if (node==null) { 
    return(0); 
  } 
  else { 
    int lDepth = maxDepth(node.left); 
    int rDepth = maxDepth(node.right);

    // use the larger + 1 
    return(Math.max(lDepth, rDepth) + 1); 
  } 
}

Anonymous · Answer

Class Node
{
        int data;
        Node left;
        Node right;
}

public static int heightOfTree(Node node)
{
    if(node!=null)
    {
        return (heightOfTree(node.left)+1+heightOfTree(node.right));
    }
}

PEAK6

PEAK6 Interview Question

Interview Answers

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches