leetcode104

最新推荐文章于 2024-08-23 11:41:28 发布

tuzhq3

最新推荐文章于 2024-08-23 11:41:28 发布

阅读量154

点赞数

本文链接：https://blog.csdn.net/tuzhq3/article/details/82961383

版权

104. 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.

Note: A leaf is a node with no children.

Example:

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

return its depth = 3.

思路：

题目求二叉树的最大深度，可以用DFS解决，使用递归的DFS可以简洁地解决此问题。

代码：

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