We are excited to announce Version 1.0.0 of datastructpy! 🎉
In this release, we have successfully implemented the Binary Search Tree (BST), providing a fully functional and well-tested data structure. The BST now includes essential operations such as:
✅ Insertion - Adds elements while maintaining BST properties.
✅ Search - Supports both Depth-First Search (DFS) and Breadth-First Search (BFS).
✅ Deletion - Handles all cases, including nodes with zero, one, or two children.
✅ Tree Construction - list_to_tree() allows quick BST creation from a list of elements.
🔹 Key Enhancements
• Comprehensive Unit Tests: Each function is rigorously tested using pytest, ensuring correctness and stability.
• Refactored and Standardized Docstrings: Improved clarity and documentation consistency across all functions and test cases.
• Updated README: Expanded documentation to reflect the latest BST functionalities with detailed examples.
• Formatted and Structured Test Files: Ensured a uniform format across all test cases for better maintainability.