[Leetcode] Minimum Depth of Binary Tree, leetcodedepth

[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.

Code:

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.