mitigation

Author: arvinder004

pydatastructs/trees/fenwich_tree.py

@@ -87,4 +87,3 @@ def range_sum(self, start_index, end_index):
             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) is 1 and not node.is_end_of_word:
+        while len(node.children) == 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 is 0
+        return self.word_count == 0
 
     def find_all_words(self):
         """Retrieves all words currently stored in the Trie."""
@@ -118,5 +118,3 @@ def longest_word(self):
         if not all_words:
             return None
         return max(all_words, key=len)
-
-