leetcodeOJ 104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

最大深度问题，注意要引用传递

/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode* root) {
int max = 0;
int* p = &max;
maxDpt(root, 0, p);
return max;
}

private:

void maxDpt(TreeNode* root, int dep, int* p){
if(root==NULL){
return;
}
dep++;
if(!root->left && !root->right){
if(*p < dep){
*p = dep;
// cout<<*p<<endl;
}
}

maxDpt(root->left, dep, p);
maxDpt(root->right, dep, p);
dep--;
}
};