题解 | #二叉树的深度#
二叉树的深度
http://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b
/**
- struct TreeNode {
- int val;
- struct TreeNode *left;
- struct TreeNode *right;
- }; / /*
- 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
- @param pRoot TreeNode类
- @return int整型 / int TreeDepth(struct TreeNode pRoot ) { // write code here if (!pRoot) return 0; int lval = TreeDepth(pRoot->left); int rval = TreeDepth(pRoot->right); return max(lval, rval) + 1; } int max(int m,int n){ if(m>n) return m; return n; }
