new line

Author: arvinder004

pydatastructs/trees/fenwich_tree.py

@@ -87,5 +87,4 @@ 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/tests/test_trie.py

@@ -108,4 +108,5 @@ def test_longest_word():
     trie.bulk_insert(["apple", "banana", "application"])
     assert trie.longest_word() == "application"
     trie.insert("a")
-    assert trie.longest_word() == "application"
+    assert trie.longest_word() == "application"
+

pydatastructs/trees/trie.py

@@ -118,4 +118,5 @@ def longest_word(self):
         if not all_words:
             return None
         return max(all_words, key=len)
+