Initial File

netsetos · web-flow · commit ea68ec2866e5 · 2020-01-30T22:37:30.000+05:30
Find minimum difference between  two elements of Binary Tree | Data Structures #Python Code
diff --git a/min_diff.py b/min_diff.py
@@ -0,0 +1,18 @@
+def minimum_diff_ele(arr):
+    arr=sorted(arr)
+    size=len(arr)
+    min_diff = 9999*999
+
+    for i in range(size-1):
+        if(arr[i+1]- arr[i] < min_diff):
+            min_diff = arr[i+1]- arr[i]
+    return min_diff
+
+
+arr=[ 5, 32 , 45, 4, 12, 18, 25]
+print("Minimum difference between elements of an array is",minimum_diff_ele(arr))
+
+
+
+
+
