/*52.二元树的深度（树）。题目：输入一棵二元树的根结点，求该树的深度。从根结点到叶结点依次经过的结点（含根、叶结点）形成树的一条路径，最长路径的长度为树的深度。例如：输入二元树： 10/    6       14/    /       4    12     16输出该树的深度 3。二元树的结点定义如下：struct SBinaryTreeNode // a node of the binary tree{int  m_nValue; // value of nodeSBinaryTreeNode *m_pLeft;  // left child of nodeSBinaryTreeNode *m_pRight;  // right child of node};*/#include <stdio.h>#include <stdlib.h>typedef 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};int maxdeep(SBinaryTreeNode * T){    if (T == NULL)    {        return 0;    }    else    {                int leftdeep = maxdeep(T->m_pLeft);        int rightdeep = maxdeep(T->m_pRight);        return (leftdeep > rightdeep) ? leftdeep + 1 : rightdeep + 1; //最大深度是左子树 和 右子树 中深度最大的加 1    }}void createTree(SBinaryTreeNode * &T){    int data;    scanf("%d", &data);    if (data != 0)    {        T = (SBinaryTreeNode *)malloc(sizeof(SBinaryTreeNode));        T->m_nValue =http://www.mamicode.com/ data;        T->m_pLeft = NULL;        T->m_pRight = NULL;        createTree(T->m_pLeft);        createTree(T->m_pRight);    }}int main(){    SBinaryTreeNode * T = NULL;    createTree(T);    int deep = maxdeep(T);    return 0;}