Leetcode_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) {
return getDepth(root);
}

int getDepth(TreeNode* root)
{
if(root == NULL)
{
return 0;
}
else
{
return max(getDepth(root->left), getDepth(root->right)) + 1;
}
}
};