pyupgrade --py37-plus **/*.py (#1654)

* pyupgrade --py37-plus **/*.py

* fixup! Format Python code with psf/black push

data_structures/binary_tree/avl_tree.py

@@ -1,4 +1,3 @@
-# -*- coding: utf-8 -*-
 """
 An auto-balanced binary tree!
 """

data_structures/binary_tree/red_black_tree.py

@@ -467,7 +467,7 @@ class RedBlackTree:
         from pprint import pformat
 
         if self.left is None and self.right is None:
-            return "'%s %s'" % (self.label, (self.color and "red") or "blk")
+            return "'{} {}'".format(self.label, (self.color and "red") or "blk")
         return pformat(
             {
                 "%s %s"

data_structures/binary_tree/treap.py

@@ -2,7 +2,7 @@ from random import random
 from typing import Tuple
 
 
-class Node(object):
+class Node:
     """
     Treap's node
     Treap is a binary tree by value and heap by priority
@@ -18,11 +18,10 @@ class Node(object):
         from pprint import pformat
 
         if self.left is None and self.right is None:
-            return "'%s: %.5s'" % (self.value, self.prior)
+            return f"'{self.value}: {self.prior:.5}'"
         else:
             return pformat(
-                {"%s: %.5s" % (self.value, self.prior): (self.left, self.right)},
-                indent=1,
+                {f"{self.value}: {self.prior:.5}": (self.left, self.right)}, indent=1,
             )
 
     def __str__(self):

data_structures/data_structures/heap/heap_generic.py

@@ -1,4 +1,4 @@
-class Heap(object):
+class Heap:
     """A generic Heap class, can be used as min or max by passing the key function accordingly.
     """
 

data_structures/hashing/hash_table.py

@@ -28,7 +28,7 @@ class HashTable:
 
     def _step_by_step(self, step_ord):
 
-        print("step {0}".format(step_ord))
+        print(f"step {step_ord}")
         print([i for i in range(len(self.values))])
         print(self.values)
 

data_structures/stacks/stack.py

@@ -1,7 +1,7 @@
 __author__ = "Omkar Pathak"
 
 
-class Stack(object):
+class Stack:
     """ A stack is an abstract data type that serves as a collection of
     elements with two principal operations: push() and pop(). push() adds an
     element to the top of the stack, and pop() removes an element from the top