[LeetCode] Maximum Depth of Binary Tree

/**
* 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) {
if( !root )
return 0;
else{
int maxDepthLeft = maxDepth( root->left );
int maxDepthRight = maxDepth( root->right );
return (maxDepthLeft>maxDepthRight) ? (maxDepthLeft+1) : (maxDepthRight+1);
}
}
};

/**
* 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) {
if( !root )
return 0;
else{
int maxDepthLeft = maxDepth( root->left );
int maxDepthRight = maxDepth( root->right );
return max(maxDepthLeft, maxDepthRight) + 1;
}
}
};