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.

Subscribe to see which companies asked this question

思路：

很简单的一个递归程序，从根节点开始，递归求左右子树的最大值，然后加上根节点1。

代码：

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