[leetcode]Minimum Depth of Binary Tree，leetcodedepth

[leetcode]Minimum Depth of Binary Tree，leetcodedepth

問題描述：

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;}

leetcode是什

裡面有很編程多面試的題目，可以線上編譯運行。難度比較高。如果自己能都做出來，對面大公司很有協助。我就是做的那裡的題目。
 
leetcode網站裡面的題目可以用C語言做?只看到C++,java,與python

C++是相容C語言的啊