Leetcode-Minimum Depth of Binary Tree

Source: Internet
Author: User

Leetcode-Minimum Depth of Binary Tree
Minimum Depth of Binary Tree Total Accepted: 32062 Total Submissions: 110013My SubmissionsQuestionSolution

Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

Show TagsHave you met this question in a real interview?

/** * 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 minDepth(TreeNode *root) {        if(root==NULL)            return 0;                int l=minDepth(root->left);        int r=minDepth(root->right);                if(l==0&&r==0)            return 1;        if(l==0||r==0)            return l>r?l+1:r+1;        if(l!=0&&r!=0)            return l>r?r+1:l+1;    }};

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.