Leetcode 104 Maximum Depth of Binary Tree（DFS）

题目连接：Leetcode 104 Maximum Depth of Binary Tree

解题思路：递归，每次返回左子树和右子树中深度较的值加一。

/**
 * 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 == NULL) return 0;
			return max(maxDepth(root->left), maxDepth(root->right)) + 1;
		}
};