FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
coding-Interview/SubtreeAnotherTree.java at master · arjunmullick/coding-Interview · GitHub
arjunmullick
/
coding-Interview
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
3
Code
Issues
0
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
coding-Interview
/
SubtreeAnotherTree.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
34 lines (28 loc) · 989 Bytes
Breadcrumbs
coding-Interview
/
SubtreeAnotherTree.java
Copy path
File metadata and controls
34 lines (28 loc) · 989 Bytes
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
package
com
.
leetcode
;
public
class
SubtreeAnotherTree
{
//https://leetcode.com/problems/subtree-of-another-tree/
//Definition for a binary tree node.
public
class
TreeNode
{
int
val
;
TreeNode
left
;
TreeNode
right
;
TreeNode
() {}
TreeNode
(
int
val
) {
this
.
val
=
val
; }
TreeNode
(
int
val
,
TreeNode
left
,
TreeNode
right
) {
this
.
val
=
val
;
this
.
left
=
left
;
this
.
right
=
right
;
}
}
class
Solution
{
public
boolean
isSubtree
(
TreeNode
s
,
TreeNode
t
) {
return
s
!=
null
&& (
equal
(
s
,
t
) ||
isSubtree
(
s
.
left
,
t
) ||
isSubtree
(
s
.
right
,
t
));
}
public
boolean
equal
(
TreeNode
s
,
TreeNode
t
) {
if
(
s
==
null
&&
t
==
null
)
return
true
;
if
(
s
==
null
)
return
false
;
if
(
t
==
null
)
return
false
;
return
s
.
val
==
t
.
val
&&
equal
(
s
.
left
,
t
.
left
) &&
equal
(
s
.
right
,
t
.
right
);
}
}
}
Back
|
FazBrowse Home
|
New Git URL