added some sorts

Author: shiningflash

Advance-Data-Structure/PYTHON/custom_sort.py

@@ -1,3 +1,5 @@
+import functools
+
 arr = [[100, 200], [200, 1300], [1000, 1250], [20, 1300]]
 
 
@@ -18,12 +20,11 @@
 # 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)
+print(arr)

Advance-Data-Structure/PYTHON/graph/dfs_2d.py

@@ -38,7 +38,7 @@ def dfs_2d(grid, ROW, COLUMN, visited, row, column):
 
         for i in range(4):
             nx = x + dx[i]
-            ny = x + dy[i]
+            ny = y + dy[i]
             queue.append((nx, ny))
 
 

Advance-Data-Structure/PYTHON/priority_queue.py

@@ -1,24 +1,26 @@
 import heapq
 
+
 class PriorityQueue:
     def __init__(self):
         self.elements = []
-        
+
     def is_empty(self):
         return not self.elements
-    
+
     def put(self, item, priority):
         heapq.heappush(self.elements, (priority, item))
-        
+
     def get(self):
         if self.is_empty():
             print('Priority queue empty...')
             raise SystemExit
         return heapq.heappop(self.elements)[1]
-    
+
     def __str__(self):
         return str(self.elements)
-    
+
+
 if __name__ == '__main__':
     q = PriorityQueue()
     print(q)
@@ -30,4 +32,4 @@ def __str__(self):
     print(q.get())
     print(q.get())
     print(q.get())
-    print(q.get())
+    print(q.get())

Advance-Data-Structure/PYTHON/read_file.py

@@ -11,8 +11,9 @@ def read_file(file_name):
     except OSError:
         print("There is a problem")
         raise SystemExit
-    
-if __name__ == '__main__' :
+
+
+if __name__ == '__main__':
     maze = read_file("PYTHON/files/maze.txt")
     for row in maze:
-        print(row)
+        print(row)

Advance-Data-Structure/PYTHON/reverse_string_using_stack.py

@@ -13,5 +13,5 @@ def reverse_str(name):
     return rev_name
 
 if __name__ == '__main__':
-    name = 'AIRAF NUZIAF'
-    print(reverse_str(name))
+    name = 'DCBA'
+    print(reverse_str(name))

Advance-Data-Structure/PYTHON/tree/bst.py

@@ -1,8 +1,8 @@
 class BinarySearchTreeNode:
-    def __init__(self, data):
+    def __init__(self, data, left=None, right=None):
         self.data = data
-        self.left = None
-        self.right = None
+        self.left = left
+        self.right = right
 
     def insert(self, data):
         if self.data == data: