FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/DataStructures/Trees/LevelOrderTraversal.java at dev · primary-code-test/Java · GitHub
primary-code-test
Java
Repository navigation
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
DataStructures
/
Trees
/
LevelOrderTraversal.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
49 lines (41 loc) · 1.1 KB
Breadcrumbs
Java
/
DataStructures
/
Trees
/
LevelOrderTraversal.java
Copy path
File metadata and controls
49 lines (41 loc) · 1.1 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
package
DataStructures
.
Trees
;
public
class
LevelOrderTraversal
{
class
Node
{
int
data
;
Node
left
,
right
;
public
Node
(
int
item
) {
data
=
item
;
left
=
right
=
null
;
}
}
// Root of the Binary Tree
Node
root
;
public
LevelOrderTraversal
(
Node
root
) {
this
.
root
=
root
;
}
/* function to print level order traversal of tree*/
void
printLevelOrder
() {
int
h
=
height
(
root
);
int
i
;
for
(
i
=
1
;
i
<=
h
;
i
++)
printGivenLevel
(
root
,
i
);
}
/* Compute the "height" of a tree -- the number of
nodes along the longest path from the root node
down to the farthest leaf node.*/
int
height
(
Node
root
) {
if
(
root
==
null
)
return
0
;
else
{
/** Return the height of larger subtree */
return
Math
.
max
(
height
(
root
.
left
),
height
(
root
.
right
)) +
1
;
}
}
/* Print nodes at the given level */
void
printGivenLevel
(
Node
root
,
int
level
) {
if
(
root
==
null
)
return
;
if
(
level
==
1
)
System
.
out
.
print
(
root
.
data
+
" "
);
else
if
(
level
>
1
) {
printGivenLevel
(
root
.
left
,
level
-
1
);
printGivenLevel
(
root
.
right
,
level
-
1
);
}
}
}
Back
|
FazBrowse Home
|
New Git URL