[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) {        if (root == NULL) {            return 0;        }        int left_max_depth = maxDepth(root->left);        int right_max_depth = maxDepth(root->right);        return max(left_max_depth, right_max_depth) + 1;    }};