-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Automatically generated by python-semantic-release
- Loading branch information
1 parent
2ec36f3
commit db5cd64
Showing
2 changed files
with
3 additions
and
38 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,39 +1,4 @@ | ||
# Changelog | ||
# CHANGELOG | ||
|
||
<!--next-version-placeholder--> | ||
|
||
## 1.1.0 | ||
|
||
- Third release of `datastructpy`! | ||
|
||
For this release, we focused on enhancing user experience by adding detailed documentation and a step-by-step tutorial to help users effectively utilize the package. The documentation covers all key features, installation instructions, usage examples, and best practices, ensuring users can quickly get started and resolve any challenges they may face. | ||
|
||
In addition to creating the documentation, we published it on **Read the Docs**, a platform specifically designed for hosting and displaying documentation in a user-friendly and visually appealing format. By leveraging Read the Docs, users can access a well-organized and searchable guide, making it easier to find relevant information. This step ensures greater accessibility, allowing users to explore the package’s capabilities with clarity and confidence. | ||
|
||
|
||
|
||
## 1.0.0 | ||
|
||
- Second release of `datastructpy`! | ||
|
||
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. | ||
|
||
|
||
|
||
## 0.0.1 | ||
|
||
- First release of `datastructpy`! | ||
|
||
We are excited to announce Version 0.0.1 of `datastructpy`. In this release, we laid the foundation for the software package by selecting a topic focused on customizable implementations of essential data structures and establishing a collaborative framework. We began by drafting a comprehensive team work contract to define roles, responsibilities, and communication protocols. A public GitHub repository was created to host the project, featuring a clear directory structure and key files such as README.md, CONDUCT.md, and CONTRIBUTING.md to support development. `datastructpy` aims to offer a practical and intuitive experience for working with data structures, including Binary Search Trees (BST), making it an ideal resource for technical interview preparation and educational projects. Additionally, we documented detailed function specifications and created placeholder functions to guide future implementation. This milestone provides a robust and well-organized starting point for the package's development and future enhancements. | ||
## v0.0.0 (2025-02-02) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters