【leetcode】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.

直接使用递归，求左子树的深度+右子树的深度+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==NULL)
        {
			return 0;
        }
		else
		{
			int left=maxDepth(root->left);
			int right=maxDepth(root->right);
			return max(right,left)+1;
		}
    }
};