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

解题思路：

当节点为空时，返回0，否则返回左右儿子中最深的深度值。

代码：

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