FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
coding-Interview/AverageLevelsBinaryTree.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
/
AverageLevelsBinaryTree.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
91 lines (77 loc) · 2.54 KB
Breadcrumbs
coding-Interview
/
AverageLevelsBinaryTree.java
Copy path
File metadata and controls
91 lines (77 loc) · 2.54 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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
package
com
.
leetcode
;
import
java
.
util
.
LinkedList
;
import
java
.
util
.
List
;
import
java
.
util
.
Queue
;
public
class
AverageLevelsBinaryTree
{
//https://leetcode.com/problems/average-of-levels-in-binary-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
List
<
Double
>
averageOfLevels
(
TreeNode
root
) {
List
<
Double
>
result
=
new
LinkedList
<>();
if
(
root
==
null
)
return
result
;
Queue
<
TreeNode
>
queue
=
new
LinkedList
<>();
queue
.
offer
(
root
);
while
(
queue
.
size
() >
0
){
Queue
<
Integer
>
values
=
new
LinkedList
<>();
LinkedList
<
TreeNode
>
level
=
new
LinkedList
<>();
while
(
queue
.
size
() >
0
){
TreeNode
node
=
queue
.
poll
();
values
.
add
(
node
.
val
);
if
(
node
.
left
!=
null
)
level
.
add
(
node
.
left
);
if
(
node
.
right
!=
null
)
level
.
add
(
node
.
right
);
}
long
num
=
0
;
long
den
=
0
;
while
(
values
.
size
() >
0
){
num
+=
values
.
poll
();
den
+=
1
;
}
Double
average
= (
double
)
num
/
den
;
queue
=
level
;
result
.
add
(
average
);
}
return
result
;
}
}
}
// Optimized
class
SolutionOptimized
{
public
List
<
Double
>
averageOfLevels
(
TreeNode
root
) {
Queue
<
TreeNode
>
queue
=
new
LinkedList
<>();
List
<
Double
>
result
=
new
LinkedList
<>();
queue
.
offer
(
root
);
while
(
queue
.
size
() >
0
){
int
size
=
queue
.
size
();
long
levelNum
=
0
;
long
levelDen
=
size
;
while
(
size
>
0
){
TreeNode
node
=
queue
.
poll
();
levelNum
+=
node
.
val
;
size
--;
if
(
node
.
left
!=
null
){
queue
.
offer
(
node
.
left
);
}
if
(
node
.
right
!=
null
){
queue
.
offer
(
node
.
right
);
}
}
Double
avg
= (
double
)
levelNum
/
levelDen
;
result
.
add
(
avg
);
}
return
result
;
}
}
Back
|
FazBrowse Home
|
New Git URL