Solution for: minimum Absolute Difference BST

Author: edyluisrey

src/leetcode/LinkedListCycle.java

@@ -0,0 +1,24 @@
+package leetcode;
+
+public class LinkedListCycle {
+	
+	public static void main(String[] agrs){
+		ListNode r= new ListNode(3);
+		r.next = new ListNode(2);
+		r.next.next= new ListNode(0);
+		r.next.next.next= new ListNode(-4);
+		LinkedListCycle test = new LinkedListCycle();
+		System.out.println(test.hasCycle(r));
+	}
+
+	public boolean hasCycle(ListNode head) {
+		if(head==null || head.next==null) return false;
+		ListNode l= head.next;
+		while(l!=null){
+			if(l==head)
+				return true;
+			l= l.next;
+		}
+		return false;
+	}
+}

src/leetcode/MinimumAbsoluteDifferenceBST.java

@@ -0,0 +1,32 @@
+package leetcode;
+
+public class MinimumAbsoluteDifferenceBST {
+	private int prev=-1;
+	private int min = Integer.MAX_VALUE;
+	public static void main(String[] args){
+		TreeNode1  t = new TreeNode1(1);
+		t.right = new TreeNode1(3);
+		t.right.left = new TreeNode1(2);
+		MinimumAbsoluteDifferenceBST test = new MinimumAbsoluteDifferenceBST();
+		System.out.println(test.getMinimumDifference(t));
+	}
+	
+	public int getMinimumDifference(TreeNode1 root) {       
+        if(root==null)  return min;   
+        getMinimumDifference(root.left);
+        if(prev!=-1)
+        	min = Math.min(min, Math.abs(root.val-prev));
+    	prev=root.val;        
+        getMinimumDifference(root.right);
+        return min;
+    }
+}
+
+class TreeNode1{
+	int val;
+	TreeNode1 left;
+	TreeNode1 right;
+	TreeNode1(int x){
+		val = x;
+	}
+}