chore(heaps): max heap data comparision

Author: BrianLusina

datastructures/trees/heaps/binary/max_heap/max_heap.py

@@ -107,7 +107,7 @@ def decrease_value_at(self, index, new_val):
         It is assumed that new_val is smaller than heap[i]
         """
         self.heap[index] = new_val
-        while index != 0 and self.heap[self.get_parent_index(index)] > self.heap[index]:
+        while index != 0 and self.heap[self.get_parent_index(index)].data > self.heap[index].data:
             # Swap heap[i] with heap[parent(i)]
             self.heap[index], self.heap[self.get_parent_index(index)] = (
                 self.heap[self.get_parent_index(index)],