DFS:
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int maxDepth(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!root) return 0;
int left=maxDepth(root->left);
int right=maxDepth(root->right);
return left>right? (left+1):(right+1);
}
};
Minimum
/**
* Definition for binary tree
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
int minDepth(TreeNode *root) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!root) return 0;
int left=minDepth(root->left);
int right=minDepth(root->right);
if (left==0 && right==0) {
return 1;
}
if (left==0) {
return right+1;
}
if (right==0) {
return left+1;
}
return left<right? (left+1):(right+1);
}
};