FilesExpand file tree

 master

/

572_Subtree_of_Another_Tree.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (42 loc) · 1.31 KB

 master

/

572_Subtree_of_Another_Tree.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (42 loc) · 1.31 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

/**

* Definition for a binary tree node.

* public class TreeNode {

* int val;

* TreeNode left;

* TreeNode right;

* TreeNode(int x) { val = x; }

* }

*/

public class Solution {

// https://leetcode.com/problems/subtree-of-another-tree/solution/

HashSet < String > trees = new HashSet < > ();

public boolean isSubtree(TreeNode s, TreeNode t) {

String tree1 = preorder(s, true);

String tree2 = preorder(t, true);

return tree1.indexOf(tree2) >= 0;

}

public String preorder(TreeNode t, boolean left) {

if (t == null) {

if (left)

return "lnull";

else

return "rnull";

}

return "#"+t.val + " " +preorder(t.left, true)+" " +preorder(t.right, false);

}

// public boolean isSubtree(TreeNode s, TreeNode t) {

// return traverse(s,t);

// }

// public boolean equals(TreeNode x,TreeNode y)

// {

// if(x==null && y==null)

// return true;

// if(x==null || y==null)

// return false;

// return x.val==y.val && equals(x.left,y.left) && equals(x.right,y.right);

// }

// public boolean traverse(TreeNode s,TreeNode t)

// {

// return s!=null && ( equals(s,t) || traverse(s.left,t) || traverse(s.right,t));

// }

}