FilesExpand file tree

 master

/

SubtreeOfAnotherTree.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

70 lines (64 loc) · 1.6 KB

 master

/

SubtreeOfAnotherTree.java

Top

File metadata and controls

• Code
• Blame

70 lines (64 loc) · 1.6 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

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

package tree;

/**

* Created by gouthamvidyapradhan on 07/07/2017.

* Given two non-empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a tree consists of a node in s and all of this node's descendants. The tree s could also be considered as a subtree of itself.

* <p>

* Example 1:

* Given tree s:

* <p>

* 3

* / \

* 4 5

* / \

* 1 2

* Given tree t:

* 4

* / \

* 1 2

* Return true, because t has the same structure and node values with a subtree of s.

* Example 2:

* Given tree s:

* <p>

* 3

* / \

* 4 5

* / \

* 1 2

* /

* 0

* Given tree t:

* 4

* / \

* 1 2

* Return false.

*/

public class SubtreeOfAnotherTree {

public class TreeNode {

int val;

TreeNode left;

TreeNode right;

TreeNode(int x) {

val = x;

}

}

public static void main(String[] args) throws Exception {

}

public boolean isSubtree(TreeNode s, TreeNode t) {

if (s != null) {

if (s.val == t.val) {

if (equal(s, t))

return true;

else return (isSubtree(s.left, t) || isSubtree(s.right, t));

} else return (isSubtree(s.left, t) || isSubtree(s.right, t));

}

return false;

}

private boolean equal(TreeNode s, TreeNode t) {

if (s == null && t == null)

return true;

else if (s == null || t == null)

return false;

else if (s.val != t.val) return false;

else return equal(s.left, t.left) && equal(s.right, t.right);

}

}