leetcode； 104. Maximum Depth of Binary Tree

题目解析：

题目链接：https://leetcode.com/problems/maximum-depth-of-binary-tree/description/

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 k = 0;
    int maxDepth(TreeNode* root) {
        if(!root)
            return 0;
        int left = maxDepth(root->left)+1;
        int right = maxDepth(root->right)+1;
        return  max(left,right);
    }
   
};