SymmetricTree.js #69
Merged
SymmetricTree.js #69
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
In Binary Trees Data Structure, I've proposed a solution to one of the most renowned interview questions asked in the "FAANG" firms. I employed the "Depth First Search" traversal technique to check if it is a Symmetric Tree. Given the root of a binary tree, we check whether it is a mirror of itself (i.e., symmetric around its center).
Collaborator
|
Thanks for the PR! LGTM, Merging this! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
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.
In Binary Trees Data Structure, I've proposed a solution to one of the most renowned interview questions asked in the "FAANG" firms. I employed the "Depth First Search" traversal technique to check if it is a Symmetric Tree. Given the root of a binary tree, we check whether it is a mirror of itself (i.e., symmetric around its center).