Added solution for Problem 1028 in Java using Stack #2
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
vishwajeetmishra4
approved these changes
Apr 12, 2025
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.
name: "Pull Request"
description: "Added solution for LeetCode Problem 1028"
labels: ["solution"]
📌 Description
Added solution for LeetCode Problem 1028 – Recover a Tree From Preorder Traversal in Java using Stack.
🔍 Related Issue
N/A
🚀 Changes Made
Added RecoverTreeFromPreorder.java in the Java/ folder.
Wrote a clean, commented solution using a Stack to build the binary tree.
Added main() function for quick testing.
Included preorder traversal print for validation.
📝 Checklist
Solution is in the correct folder (Java/).
Code is well-formatted and commented.
Problem description and test case added.
No plagiarism — original solution.
📷 Screenshots (if applicable)
💬 Additional Notes
N/A