二叉树的最大深度

二叉树的最大深度

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