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