added some sorts

Author: shiningflash

Diff for: Advance-Data-Structure/PYTHON/custom_sort.py

@@ -1,18 +1,29 @@
 arr = [[100, 200], [200, 1300], [1000, 1250], [20, 1300]]
 
 
-import functools
+# import functools
 
 
-def compare(x, y):
-    if x[1] < y[1]:
-        return -1
-    if x[1] == y[1]:
-        if x[0] < y[0]:
-            return -1
-    return 1
+# def compare(x, y):
+#     if x[1] < y[1]:
+#         return -1
+#     if x[1] == y[1]:
+#         if x[0] < y[0]:
+#             return -1
+#     return 1
 
 
-arr = sorted(arr, key=functools.cmp_to_key(compare))
+# arr = sorted(arr, key=functools.cmp_to_key(compare))
+
+# print(arr)
+
 
-print(arr)
+import functools
+
+def compare(x, y):
+    if y[1] > x[1]:
+        return 1
+    return -1
+
+arr = sorted(arr, key=functools.cmp_to_key(compare))
+print(arr)

Diff for: Advance-Data-Structure/PYTHON/graph/bfs_2d.py

@@ -24,9 +24,7 @@ def bfs_2d(grid, ROW, COLUMN, visited, row, column):
     visited[row][column] = True
 
     while queue:
-        front = queue.popleft()
-        x = front[0]
-        y = front[1]
+        x, y = queue.popleft()
         print(grid[x][y], end=' ')
 
         for i in range(4):

Diff for: Advance-Data-Structure/PYTHON/graph/dfs_2d.py

@@ -28,10 +28,7 @@ def dfs_2d(grid, ROW, COLUMN, visited, row, column):
     queue = [(row, column)]
 
     while queue:
-        top = queue.pop()
-        # print(top, top[0], top[1], '===')
-        x = top[0]
-        y = top[1]
+        x, y = queue.pop()
 
         if not isValid(x, y, ROW, COLUMN, visited):
             continue

Diff for: Advance-Data-Structure/PYTHON/tree/bst.py

@@ -19,6 +19,29 @@ def insert(self, data):
             else:
                 self.right = BinarySearchTreeNode(data)
 
+    def delete(self, data):
+        if not self:
+            return None
+        elif data < self.data:
+            if self.left:
+                self.left = self.left.delete(data)
+        elif data > self.data:
+            if self.right:
+                self.right = self.right.delete(data)
+        else:
+            if not self.left and not self.right:
+                return None
+            if not self.left:
+                return self.right
+            if not self.right:
+                return self.left
+
+            # take minimum value from right subtree
+            rightMinVal = self.right.findMin()
+            self.data = rightMinVal
+            self.right = self.right.delete(rightMinVal)
+        return self
+
     def search(self, data):
         if self.data == data:
             return True
@@ -82,14 +105,43 @@ def buildTree(elementList):
     return root
 
 
-if __name__ == '__main__':
-    elementList = [234, 12, 1, 3234, 23, 4, 1, 100]
-    tree = buildTree(elementList)
+def printTree(tree):
+    if not tree:
+        print('Tree empty!!!')
+        return
+
     print('pre order traversal: ', tree.preOrderTraversal())
     print('in order traversal: ', tree.inOrderTraversal())
     print('post order traversal: ', tree.postOrderTraversal())
+
+
+def deleteAndCheck(tree, data):
+    print('\ndeleting: ', data)
+    if not tree:
+        print('Tree empty!!!')
+        return tree
+
+    tree = tree.delete(data)
+    printTree(tree)
+    return tree
+
+
+if __name__ == '__main__':
+    elementList = [234, 12, 1, 3234, 23, 4, 1, 100]
+    # elementList = [12]
+    tree = buildTree(elementList)
+    printTree(tree)
     print('search 12: ', tree.search(12))
     print('search 110: ', tree.search(110))
     print('min value: ', tree.findMin())
     print('max value: ', tree.findMax())
     print('sum of elements: ', sum(tree.inOrderTraversal()))
+    tree = deleteAndCheck(tree, 12)
+    tree = deleteAndCheck(tree, 123456)
+    tree = deleteAndCheck(tree, 1)
+    tree = deleteAndCheck(tree, 234)
+    tree = deleteAndCheck(tree, 4)
+    tree = deleteAndCheck(tree, 100)
+    tree = deleteAndCheck(tree, 23)
+    tree = deleteAndCheck(tree, 3234)
+    tree = deleteAndCheck(tree, 12)

Diff for: Advance-Data-Structure/sqrt_decomposition.cpp

@@ -39,7 +39,7 @@ int main() {
 }
 
 /*
----------
+---------f
 INPUT:
 9
 1 1 1 2 2 2 3 3 3

Diff for: Dynamic-Programming/longestPalindromeSubsequence.cpp

@@ -14,6 +14,8 @@ int L(string s, int i, int j) {
     else return max(L(s, i+1, j), L(s, i, j-1));
 }
 
+
+
 /*
 
 dp[][] ::  for"TURBOVENTILATOR"
@@ -59,7 +61,7 @@ int lps_2D(string s, int n) {
 int lps_1D(string s, int n) {
     int dp[n];
     for (int i = n-1; i >= 0; i--) {
-        int back_up = 0;
+        int back_up = 0;r
         for (int j = i; j < n; j++) {
             if (i == j) dp[j] = 1;
             else if (s[i] == s[j]) {

Diff for: Sorting-Algorithms/quick_sort.py

@@ -18,7 +18,7 @@ def quick_sort(arr):
     greater_part = []
 
     for x in arr:
-        if x < pivot:
+        if x < pivot
             lower_part.append(x)
         else:
             greater_part.append(x)