二叉搜索树部分题目

zjg23 · zjg23 · commit 85daea79791e · 2019-04-24T11:49:15.000+08:00
diff --git a/Week_02/id_27/LeetCode_783_027.java b/Week_02/id_27/LeetCode_783_027.java
@@ -0,0 +1,58 @@
+/**
+ * Definition for a binary tree node.
+ * public class TreeNode {
+ *     int val;
+ *     TreeNode left;
+ *     TreeNode right;
+ *     TreeNode(int x) { val = x; }
+ * }
+ */
+class Solution {
+
+
+
+    //&#20108;&#21449;&#25628;&#32034;&#26641;&#20013;&#24207;&#36941;&#21382;&#24471;&#21040;&#36882;&#22686;&#24207;&#21015;&#65292;&#28982;&#21518;&#27714;&#24046;&#20540;&#26368;&#23567;
+
+
+
+	public int minDiffInBST(TreeNode root) {
+		List<Integer> res = new ArrayList<Integer>();
+		inorder(root,res);
+		int min = Integer.MAX_VALUE;
+		for(int i=1;i<res.size();i++) {
+			min= Math.min(min, res.get(i)-res.get(i-1));
+		}
+		return min;
+	}
+
+	private void inorder(TreeNode root,List<Integer> res) {
+		if(null == root) return;
+
+		inorder(root.left,res);
+		res.add(root.val);
+		inorder(root.right,res);
+	}
+
+	public static void main(String[] args) {
+		//[27,null,34,null,58,50,null,44,null,null,null]
+		TreeNode root = new TreeNode(44);
+		TreeNode t1 = new TreeNode(34);
+		TreeNode t2 = new TreeNode(58);
+		TreeNode t3 = new TreeNode(27);
+		TreeNode t4 = new TreeNode(36);
+
+		root.left = t1;
+		root.right=t2;
+		t1.left=t3;
+		t1.right=t4;
+
+		System.out.println(new Solution().minDiffInBST(root));
+
+	}
+
+
+
+
+
+
+}
