当前位置：网站首页>[force buckle] maximum depth of binary tree

[force buckle] maximum depth of binary tree

2022-07-19 06:26:00 【Patrick star`】

104. The maximum depth of a binary tree - Power button （LeetCode）

subject ：

Given a binary tree , Find out the maximum depth .

The depth of a binary tree is the number of nodes in the longest path from the root node to the farthest leaf node .

explain :  A leaf node is a node that has no children

Ideas ：

Using preorder traversal , Depth of each recursive layer +1

Code ：

int maxDepth(struct TreeNode* root)
{
    if(root == NULL)
    {
        return 0;
    }
    int ldepth = maxDepth(root->left);// The height of the left subtree 
    int rdepth = maxDepth(root->right);// The height of the right subtree 
    return ldepth > rdepth ? ldepth + 1:rdepth + 1;
}

原网站

版权声明
本文为[Patrick star`]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/200/202207170509308280.html

边栏推荐

猜你喜欢

随机推荐