[Leetcode] Minimum Depth of Binary Tree, leetcodedepth

Source: Internet
Author: User

[Leetcode] Minimum Depth of Binary Tree, leetcodedepth

Problem description:

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.


public class TreeNode {      int val;      TreeNode left;      TreeNode right;      TreeNode(int x) { val = x; } }public int minDepth(TreeNode root) {if(root == null)return 0;return getHigh(root);    }public int getHigh(TreeNode root){if(root.left == null && root.right ==null)return 1;int lmin = Integer.MAX_VALUE;int rmin = Integer.MAX_VALUE;if(root.left != null)lmin = getHigh(root.left);if(root.right !=null)rmin = getHigh(root.right);return Math.min(lmin, rmin)+1;}

What is leetcode?

There are many programming and interview questions, which can be compiled and run online. It is difficult. If you can do it all by yourself, it is very helpful for large companies. I just did the questions there.

Can I use the C language for the questions on the leetcode website? Only C ++, java, and python

C ++ is compatible with C language.

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.