I've implemented P67: String representation of binary trees. #78
Conversation
This file contains hidden or 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
This commit introduces the `BtreeP67` class, which provides functionality to convert binary trees to and from a specific string format. The string representation follows the pattern: `value(left_subtree,right_subtree)`. - Leaf nodes are represented by their value alone (e.g., "d"). - Empty subtrees are represented by an empty string between separators (e.g., "c(,f)" for a node "c" with no left child, or "f(g,)" for a node "f" with no right child). Key features I implemented: - `BtreeP67.fromString(String representation)`: This parses the string and constructs the corresponding binary tree. I've included validation for malformed strings. - `BtreeP67.toString()`: This converts a binary tree into its string representation. - `equals()` and `hashCode()` methods for both `BtreeP67` and its inner `Node` class to ensure correct structural comparison. I've also added a comprehensive suite of JUnit 5 tests (`BtreeP67Test.java`) to verify: - Correct parsing of various valid tree strings. - Accurate serialization of trees to strings. - Robustness of round-trip conversions (string -> tree -> string and tree -> string -> tree). - Handling of edge cases (e.g., empty strings, leaf nodes represented as "val(,)"). - Appropriate error handling for malformed input strings.
This commit introduces the BtreeP67 class, which provides functionality to convert binary trees to and from a specific string format, addressing problem P67. The string representation follows the pattern: `value(left_subtree,right_subtree)`. - Leaf nodes are represented by their value alone (e.g., "d"). - Empty subtrees are represented by an empty string between separators (e.g., "c(,f)" for a node "c" with no left child, or "f(g,)" for a node "f" with no right child). Key features implemented in BtreeP67.java: - `BtreeP67.fromString(String representation)`: Parses the string and constructs the corresponding binary tree. Includes validation for malformed strings. - `BtreeP67.toString()`: Converts a binary tree into its string representation. - `equals()` and `hashCode()` methods for both `BtreeP67` and its inner `Node` class to ensure correct structural comparison. A comprehensive suite of JUnit 5 tests (`BtreeP67Test.java`) has been added. These tests have been verified to pass, while the `pom.xml` targets Java 22, ensuring compatibility with matrix testing environments. The `pom.xml` file remains unchanged by this commit to support the project's matrix testing strategy across different Java versions.
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This commit introduces the
BtreeP67class, which provides functionality to convert binary trees to and from a specific string format.The string representation follows the pattern:
value(left_subtree,right_subtree).Key features I implemented:
BtreeP67.fromString(String representation): This parses the string and constructs the corresponding binary tree. I've included validation for malformed strings.BtreeP67.toString(): This converts a binary tree into its string representation.equals()andhashCode()methods for bothBtreeP67and its innerNodeclass to ensure correct structural comparison.I've also added a comprehensive suite of JUnit 5 tests (
BtreeP67Test.java) to verify: