FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
coding-Interview/SameTree.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
/
SameTree.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
38 lines (29 loc) · 841 Bytes
Breadcrumbs
coding-Interview
/
SameTree.java
Copy path
File metadata and controls
38 lines (29 loc) · 841 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
35
36
37
38
package
com
.
leetcode
;
public
class
SameTree
{
//https://leetcode.com/problems/same-tree/
class
Solution
{
public
boolean
isSameTree
(
TreeNode
p
,
TreeNode
q
) {
if
(
q
==
null
&&
p
==
null
)
return
true
;
if
((
q
==
null
&&
p
!=
null
) || (
p
==
null
&&
q
!=
null
))
return
false
;
if
(
q
.
val
!=
p
.
val
)
return
false
;
return
isSameTree
(
p
.
left
,
q
.
left
) &&
isSameTree
(
p
.
right
,
q
.
right
);
}
}
/**
* 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
.
left
=
left
;
this
.
right
=
right
;
}
}
}
Back
|
FazBrowse Home
|
New Git URL