Create trie.py

[rishanmenezes]

Description

This PR adds a comprehensive Trie (Prefix Tree) data structure implementation to the DSA_Code repository.

What's Added

• File: Python/data_structures/trees/trie.py
• Implementation: Complete Trie data structure with all essential operations

Features Included

Core Operations

• insert(word) - Insert a word into the trie
• search(word) - Search for a complete word
• starts_with(prefix) - Check if any word starts with prefix
• delete(word) - Delete a word from the trie

Advanced Operations

• get_all_words_with_prefix(prefix) - Get all words with a given prefix
• autocomplete(prefix, limit) - Get autocomplete suggestions
• count_words_with_prefix(prefix) - Count words starting with prefix
• longest_common_prefix() - Find longest common prefix of all words
• get_all_words() - Retrieve all words in the trie
• is_empty(), size(), clear() - Utility methods

Documentation

✅ Comprehensive docstrings for all methods
✅ Time and space complexity analysis included
✅ Detailed algorithm description in header
✅ Example usage and test cases in __main__ block
✅ Use cases explained (autocomplete, spell checking, IP routing, dictionaries)

Code Quality

• Follows Python naming conventions (snake_case)
• Well-structured with helper methods
• Properly commented and documented
• Includes practical examples demonstrating all features
• Type hints for better code clarity

Testing

The implementation includes comprehensive test cases in the __main__ block demonstrating:

• Insert and search operations
• Prefix checking
• Autocomplete functionality
• Word counting
• Delete operations
• Longest common prefix calculation

This contribution follows all the contributing guidelines and aims to provide a high-quality, educational implementation of the Trie data structure for the repository.

[github-actions]

💎 Code Quality Check Results

❌ Missing Algorithm Description

These files don't explain what the algorithm does:

• Python/data_structures/trees/trie.py

Required: Add a description explaining the algorithm, its purpose, and how it works

📚 Quality Standards

To maintain high quality, every contribution should include:

1. ✍️ Algorithm Description

   • Explain what the algorithm does
   • Describe the approach and methodology
   • Include use cases or applications

2. 📊 Complexity Analysis

   • Time complexity (e.g., O(n log n))
   • Space complexity (e.g., O(n))
   • Brief explanation of why

3. 💬 Meaningful Comments

   • Explain complex logic
   • Document function parameters
   • Add inline comments for clarity

4. ✅ Test Cases/Examples

   • Demonstrate the code works
   • Show different input scenarios
   • Include edge cases

💡 Example Template

"""
Binary Search Algorithm

Description: Searches for a target value in a sorted array using divide-and-conquer

Time Complexity: O(log n) - halves search space each iteration
Space Complexity: O(1) - only uses constant extra space
"""

def binary_search(arr, target):
    # Initialize pointers
    left, right = 0, len(arr) - 1

    while left <= right:
        mid = (left + right) // 2

        # Check if target found
        if arr[mid] == target:
            return mid
        # Search right half
        elif arr[mid] < target:
            left = mid + 1
        # Search left half
        else:
            right = mid - 1

    return -1  # Not found

# Test cases
if __name__ == "__main__":
    test_arr = [1, 3, 5, 7, 9]
    print(binary_search(test_arr, 5))  # Output: 2
    print(binary_search(test_arr, 6))  # Output: -1

🔧 How to Fix

1. Review each file mentioned above
2. Add the missing documentation
3. Push your changes
4. The workflow will re-run automatically

💪 You've Got This!

These checks help maintain quality and make your contribution more valuable to learners. Thank you for taking the time to improve! 🙏

---

Quality over quantity - let's build something amazing together! 🌟

[github-actions]

🎉 Welcome to Hacktoberfest 2025, @rishanmenezes! 🎃

Thank you for your first contribution to our DSA repository! Here's what happens next:

🔍 Automatic Checks

• ✅ Code Validation: Passed
• 🧪 Compilation Tests: Passed

📋 Next Steps

🎯 Great job! Your code compiled successfully. Maintainers @Karanjot786 and @Pradeepsingh61 will review your PR soon.

🎁 What You Get

• 🏆 Hacktoberfest Credit: This PR counts toward your 6 PR goal for exclusive T-shirt + Tree!
• 🌟 Hall of Fame: You'll be featured in our contributors list
• 📚 Learning: Code review feedback from experienced developers

💡 Tips for Success

• Follow our Contributing Guidelines
• Add comments explaining your algorithm
• Include time/space complexity analysis
• Test your code before submitting

Welcome to the community! 🚀

[github-actions]

🤖 Automated PR Status

🔍 Code Validation

✅ Passed - File naming and structure look good!

🧪 Compilation Tests

✅ Passed - All code compiles successfully!

📋 Overall Status

🎉 Ready for Review - Your PR has passed all automated checks!
👥 Maintainers have been notified for review.

---

This comment was generated automatically. Checks will re-run when you push new commits.