white spaces removal

Author: arvinder004

pydatastructs/trees/fenwich_tree.py

@@ -18,7 +18,7 @@ def __init__(self, size_or_array):
         if isinstance(size_or_array, int):
             self.size = size_or_array
             self.tree = [0] * (self.size + 1)
-            self.original_array = [0] * self.size 
+            self.original_array = [0] * self.size
         elif isinstance(size_or_array, list):
             self.original_array = list(size_or_array)
             self.size = len(self.original_array)
@@ -27,7 +27,7 @@ def __init__(self, size_or_array):
                 self._update_tree(i, val)
         else:
             raise ValueError("size_or_array must be an integer or a list.")
-        
+
     def _update_tree(self, index, delta):
         """
         Internal helper to update the Fenwick Tree after a change in the original array.
@@ -67,9 +67,9 @@ def prefix_sum(self, index):
         sum_val = 0
         while index > 0:
             sum_val += self.tree[index]
-            index -= index & (-index)  
+            index -= index & (-index)
         return sum_val
-    
+
     def range_sum(self, start_index, end_index):
         """
         Calculates the sum of elements within the given range (inclusive).
@@ -83,7 +83,7 @@ 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 is 0:
+        if start_index == 0:
             return self.prefix_sum(end_index)
         else:
             return self.prefix_sum(end_index) - self.prefix_sum(start_index - 1)

pydatastructs/trees/trie.py

@@ -2,47 +2,47 @@ class TrieNode:
     """Represents a node in the Trie data structure."""
     def __init__(self):
         """Initializes a TrieNode with empty children and is_end_of_word set to False."""
-        self.children = {}  
-        self.is_end_of_word = False  
-        self.word = None 
+        self.children = {}
+        self.is_end_of_word = False
+        self.word = None
 
 class Trie:
     """Represents the Trie (prefix tree) data structure."""
     def __init__(self):
         """Initializes an empty Trie with a root TrieNode."""
-        self.root = TrieNode() 
+        self.root = TrieNode()
         self.word_count = 0
 
     def insert(self, word):
         """Inserts a word into the Trie."""
-        node = self.root  
+        node = self.root
         for char in word:
             if char not in node.children:
                 node.children[char] = TrieNode()
-            node = node.children[char]  
+            node = node.children[char]
         if not node.is_end_of_word:
-          node.is_end_of_word = True  
+          node.is_end_of_word = True
           node.word = word
           self.word_count += 1
 
     def search(self, word):
         """Searches for a word in the Trie."""
-        node = self.root  
+        node = self.root
         for char in word:
             if char not in node.children:
                 return False
-            node = node.children[char]  
-        return node.is_end_of_word  
+            node = node.children[char]
+        return node.is_end_of_word
 
     def starts_with(self, prefix):
         """Checks if any word in the Trie starts with the given prefix."""
-        node = self.root  
+        node = self.root
         for char in prefix:
             if char not in node.children:
                 return False
-            node = node.children[char] 
-        return True  
-    
+            node = node.children[char]
+        return True
+
     def count_words(self):
         """Returns the total number of words stored in the Trie."""
         return self.word_count