二元树的深度

题目：输入一棵二元树的根结点，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。

例如：输入二元树：

                                            10
                                         /     \
                                       6        14
                                      /         /   \
                                   4         12     16

输出该树的深度3。

二元树的结点定义如下：

struct SBinaryTreeNode // anode of the binary tree
{
    int               m_nValue; // value of node
    SBinaryTreeNode  *m_pLeft; // left child of node
    SBinaryTreeNode  *m_pRight; // rightchild of node
};

#include<iostream>
using namespace std;
struct SBinaryTreeNode // a node of the binary tree
{
	int               m_nValue; // value of node
	SBinaryTreeNode  *m_pLeft;  // left child of node
	SBinaryTreeNode  *m_pRight; // right child of node
};
void setNull(SBinaryTreeNode *&temp)
{
	temp->m_pLeft=temp->m_pRight=NULL;
}
void build(SBinaryTreeNode *&head){
	head=new SBinaryTreeNode;
	head->m_nValue=10;
	setNull(head);
	SBinaryTreeNode *temp;
	temp=new SBinaryTreeNode;
	head->m_pLeft=temp;
	temp->m_nValue=6;
	setNull(temp);
	
	temp=new SBinaryTreeNode;
	head->m_pRight=temp;
	temp->m_nValue=14;
	setNull(temp);
	
	temp=temp->m_pRight;
	temp=new SBinaryTreeNode;
	temp->m_nValue=12;
	setNull(temp);
}
int ans(SBinaryTreeNode *head){
	if(head!=NULL)
	cout<<head->m_nValue<<endl;
	if(head==NULL)
	{
		return 0;
	}	
	return max(ans(head->m_pLeft),ans(head->m_pRight))+1;
}
int main()
{
	SBinaryTreeNode *head;
	build(head);
	cout<<ans(head);
	return 0;
}