Skip to content

Improved task 572 #1835

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Oct 11, 2024
Merged

Improved task 572 #1835

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
cf2a77d
Improved task 572
javadev Oct 11, 2024
81117a1
Fixed sonar
javadev Oct 11, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 15 additions & 15 deletions src/main/java/g0501_0600/s0572_subtree_of_another_tree/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

// #Easy #Depth_First_Search #Tree #Binary_Tree #Hash_Function #String_Matching
// #Algorithm_II_Day_7_Breadth_First_Search_Depth_First_Search
// #2022_08_10_Time_1_ms_(100.00%)_Space_47.2_MB_(13.44%)
// #2024_10_11_Time_2_ms_(97.06%)_Space_44.2_MB_(68.85%)

import com_github_leetcode.TreeNode;

Expand All @@ -22,29 +22,29 @@
* }
*/
public class Solution {
private boolean isSubtreeFound(TreeNode root, TreeNode subRoot) {
if (root == null && subRoot == null) {
public boolean isSubtree(TreeNode root, TreeNode subRoot) {
if (root == null) {
return false;
}
if (traverse(root, subRoot)) {
return true;
}
if (root == null || subRoot == null) {
return isSubtree(root.left, subRoot) || isSubtree(root.right, subRoot);
}

private boolean traverse(TreeNode root, TreeNode subRoot) {
if (root == null && subRoot != null) {
return false;
}
if (root.val == subRoot.val) {
return isSubtreeFound(root.left, subRoot.left) && isSubtree(root.right, subRoot.right);
} else {
if (root != null && subRoot == null) {
return false;
}
}

public boolean isSubtree(TreeNode root, TreeNode subRoot) {
if (root == null && subRoot == null) {
if (root == null) {
return true;
}
if (root == null || subRoot == null) {
if (root.val != subRoot.val) {
return false;
}
return isSubtreeFound(root, subRoot)
|| isSubtree(root.left, subRoot)
|| isSubtree(root.right, subRoot);
return traverse(root.left, subRoot.left) && traverse(root.right, subRoot.right);
}
}
Loading