FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode/BalancedBinaryTree.java at master · Orio77/LeetCode · GitHub
Orio77
/
LeetCode
Public
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode
/
BalancedBinaryTree.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
51 lines (47 loc) · 1.37 KB
Breadcrumbs
LeetCode
/
BalancedBinaryTree.java
Copy path
File metadata and controls
51 lines (47 loc) · 1.37 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
/**
* 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
isBalanced
(
TreeNode
root
) {
if
(
root
==
null
)
return
true
;
int
leftHeight
=
0
;
int
rightHeight
=
0
;
if
(
root
.
left
!=
null
) {
leftHeight
=
getHeight
(
root
.
left
,
1
);
if
(!
isBalanced
(
root
.
left
)) {
return
false
;
}
}
if
(
root
.
right
!=
null
) {
rightHeight
=
getHeight
(
root
.
right
,
1
);
if
(!
isBalanced
(
root
.
right
)) {
return
false
;
}
}
return
(
Math
.
abs
(
rightHeight
-
leftHeight
) >
1
) ?
false
:
true
;
}
public
int
getHeight
(
TreeNode
node
,
int
level
) {
int
leftHeight
=
0
;
int
rightHeight
=
0
;
if
(
node
.
left
!=
null
) {
leftHeight
=
getHeight
(
node
.
left
,
level
+
1
);
}
if
(
node
.
right
!=
null
) {
rightHeight
=
getHeight
(
node
.
right
,
level
+
1
);
}
return
(
leftHeight
==
0
&&
rightHeight
==
0
) ?
level
:
Math
.
max
(
leftHeight
,
rightHeight
);
}
}
Back
|
FazBrowse Home
|
New Git URL