LeetCode——Maximum Depth of Binary Tree

pickless

于 2013-09-21 23:59:26 发布

阅读量673

点赞数

CC 4.0 BY-SA版权

分类专栏： Online Judge 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/pickless/article/details/11883461

Online Judge 专栏收录该内容

134 篇文章

订阅专栏

本文将介绍如何通过递归的方式解决寻找二叉树最大深度的问题，并提供了C++实现的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

» Solve this problem

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
private:
    int depth;
    
    void traverse(TreeNode *root, int d) {
        if (root == NULL) {
            return;
        }          
        if (d > depth) {
            depth = d;
        }
        traverse(root->left, d + 1);
        traverse(root->right, d + 1);
    }
    
public:
    int maxDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        depth = 0;
        traverse(root, 1);
        return depth;
    }
};