new line

Author: arvinder004

pydatastructs/trees/fenwich_tree.py

@@ -83,8 +83,9 @@ def range_sum(self, start_index, end_index):
         """
         if not (0 <= start_index <= end_index < self.size):
             raise IndexError("Indices out of bounds")
-        if start_index == 0:
+        if start_index is 0:
             return self.prefix_sum(end_index)
         else:
             return self.prefix_sum(end_index) - self.prefix_sum(start_index - 1)
-        
+        
+

pydatastructs/trees/trie.py

@@ -51,7 +51,7 @@ def longest_common_prefix(self):
         """Finds the longest common prefix among all words in the Trie."""
         node = self.root
         prefix = ""
-        while len(node.children) == 1 and not node.is_end_of_word:
+        while len(node.children) is 1 and not node.is_end_of_word:
             char = next(iter(node.children))
             prefix += char
             node = node.children[char]
@@ -87,7 +87,7 @@ def clear(self):
 
     def is_empty(self):
         """Returns True if the Trie is empty, otherwise False."""
-        return self.word_count == 0
+        return self.word_count is 0
 
     def find_all_words(self):
         """Retrieves all words currently stored in the Trie."""
@@ -107,7 +107,7 @@ def shortest_unique_prefix(self, word):
         prefix = ""
         for char in word:
             prefix += char
-            if len(node.children[char].children) <= 1 and node.children[char].is_end_of_word == False :
+            if len(node.children[char].children) <= 1 and node.children[char].is_end_of_word is False :
                 return prefix
             node = node.children[char]
         return word
@@ -117,4 +117,5 @@ def longest_word(self):
         all_words = self.find_all_words()
         if not all_words:
             return None
-        return max(all_words, key=len)
+        return max(all_words, key=len)
+    

pydatastructs/utils/misc_util.py

@@ -623,5 +623,3 @@ def summation(x_y):
         return x if y is None else y
 
     return x + y
-
-