Fix PR review comments

Author: TechnoBlogger14o3

data_structures/advanced_trie.py

@@ -172,7 +172,26 @@ def _delete_helper(self, node: TrieNode, word: str, index: int) -> bool:
         return len(node.children) == 0 and not node.is_end_of_word
 
     def _find_node(self, word: str) -> Optional[TrieNode]:
-        """Find the node corresponding to the given word."""
+        """
+        Find the node corresponding to the given word.
+        
+        Args:
+            word: Word to find node for
+            
+        Returns:
+            TrieNode if found, None otherwise
+            
+        Examples:
+            >>> trie = Trie()
+            >>> trie.insert("hello")
+            >>> node = trie._find_node("hello")
+            >>> node is not None
+            True
+            >>> node.is_end_of_word
+            True
+            >>> trie._find_node("world") is None
+            True
+        """
         node = self.root
         for char in word:
             if char not in node.children:
@@ -209,7 +228,23 @@ def get_all_words_with_prefix(self, prefix: str) -> List[str]:
     def _collect_words(
         self, node: TrieNode, current_word: str, words: List[str]
     ) -> None:
-        """Collect all words from a given node."""
+        """
+        Collect all words from a given node.
+        
+        Args:
+            node: Current trie node
+            current_word: Current word being built
+            words: List to collect words into
+            
+        Examples:
+            >>> trie = Trie()
+            >>> trie.insert("hello")
+            >>> trie.insert("help")
+            >>> words = []
+            >>> trie._collect_words(trie._find_node("hel"), "hel", words)
+            >>> sorted(words)
+            ['hello', 'help']
+        """
         if node.is_end_of_word:
             words.append(current_word)
 

data_structures/segment_tree.py

@@ -94,14 +94,35 @@ def query(self, left: int, right: int) -> int:
             >>> st = SegmentTree([1, 2, 3, 4, 5])
             >>> st.query(1, 3)
             9
+            >>> st.query(0, 4)
+            15
+            >>> st.query(2, 2)
+            3
         """
         if left < 0 or right >= self.size or left > right:
             raise ValueError(f"Invalid range [{left}, {right}]")
 
         return self._query(0, 0, self.size - 1, left, right)
 
     def _query(self, node: int, start: int, end: int, left: int, right: int) -> int:
-        """Internal query method."""
+        """
+        Internal query method.
+        
+        Args:
+            node: Current node index
+            start: Start of current segment
+            end: End of current segment
+            left: Left boundary of query
+            right: Right boundary of query
+            
+        Returns:
+            Result of the operation over the range
+            
+        Examples:
+            >>> st = SegmentTree([1, 2, 3, 4, 5])
+            >>> st._query(0, 0, 4, 1, 3)
+            9
+        """
         if right < start or left > end:
             return self.default_value
 
@@ -238,7 +259,23 @@ def range_update(self, left: int, right: int, delta: int) -> None:
     def _range_update(
         self, node: int, start: int, end: int, left: int, right: int, delta: int
     ) -> None:
-        """Internal range update method."""
+        """
+        Internal range update method with lazy propagation.
+        
+        Args:
+            node: Current node index
+            start: Start of current segment
+            end: End of current segment
+            left: Left boundary of update
+            right: Right boundary of update
+            delta: Value to add to the range
+            
+        Examples:
+            >>> lst = LazySegmentTree([1, 2, 3, 4, 5])
+            >>> lst._range_update(0, 0, 4, 1, 3, 2)
+            >>> lst.query(1, 3)
+            11
+        """
         self._push_lazy(node, start, end)
 
         if right < start or left > end:
@@ -300,14 +337,14 @@ def _query(self, node: int, start: int, end: int, left: int, right: int) -> int:
 class MinSegmentTree(SegmentTree):
     """Segment Tree for range minimum queries."""
 
-    def __init__(self, data: List[int]):
+    def __init__(self, data: List[int]) -> None:
         super().__init__(data, min, float("inf"))
 
 
 class MaxSegmentTree(SegmentTree):
     """Segment Tree for range maximum queries."""
 
-    def __init__(self, data: List[int]):
+    def __init__(self, data: List[int]) -> None:
         super().__init__(data, max, float("-inf"))