leetcode---C++实现---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.

Note: A leaf is a node with no children.

Example:

Given binary tree [3,9,20,null,null,15,7],

return its depth = 3.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/maximum-depth-of-binary-tree

解题思路

二叉树的深度为根节点的左子树深度和右子树深度的最大值+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) {
    	if (!root)
    		return 0;
    	
    	return max(maxDepth(root->left), maxDepth(root->right)) + 1;
    }
}