实现
int TreeDepth(Node root){
if(root==null){
return 0;
}
int nleft=TreeDepth(root.left);
int nright=TreeDepth(root.right);
return (nleft>nright)?:(nleft+1):(nright+1);
}
实现
int TreeDepth(Node root){
if(root==null){
return 0;
}
int nleft=TreeDepth(root.left);
int nright=TreeDepth(root.right);
return (nleft>nright)?:(nleft+1):(nright+1);
}