【LeetCode】Maximum Depth of Binary Tree

最新推荐文章于 2024-10-15 15:32:42 发布

原创最新推荐文章于 2024-10-15 15:32:42 发布 · 572 阅读

0 ·

CC 4.0 BY-SA版权

LeetCode 专栏收录该内容

26 篇文章

订阅专栏

本文介绍了一种求解二叉树最大深度的算法实现，通过递归方式找到从根节点到最远叶子节点的最长路径上的节点数。此外，还提供了一种使用栈进行迭代的非递归解决方案。

摘要生成于 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.

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int maxDepth(TreeNode *root) 
    {
        int deep=0;
        if(root)
        {
          int lchilddeep=maxDepth(root->left);
          int rchilddeep=maxDepth(root->right);
          deep=lchilddeep>=rchilddeep?lchilddeep+1:rchilddeep+1;
        }
        return deep;
    }
};

int TreeDeep(BinTree BT ){
    int treedeep=0;
    stack S;
    stack tag;
    BinTree p=BT;
    while(p!=NULL||!isEmpty(S)){
        while(p!=NULL){
            push(S,p);
            push(tag,0);
            p=p->lchild;
        }
        if(Top(tag)==1){
            deeptree=deeptree>S.length?deeptree:S.length;
            pop(S);
            pop(tag);
            p=NULL;
        }else{
            p=Top(S);
            p=p->rchild;
            pop(tag);
            push(tag,1);
        }
    }
    return deeptree;
}