深度优先搜索,递归。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
int TreeDepth(TreeNode* pRoot)
{
if(pRoot == NULL)
return 0;
int l, r;
l = TreeDepth(pRoot -> left);
r = TreeDepth(pRoot -> right);
int h = (l > r ? l : r) + 1;
return h;
}
};