@@ -10,15 +10,15 @@ function levelOrderTraversalWithDirection(root) {
10
10
let stack = [ ] ;
11
11
stack . push ( root ) ;
12
12
let queue = [ ] ;
13
- let count = 1 ;
13
+ let leftToRight = true ;
14
14
while ( stack . length != 0 ) {
15
15
let levelElements = '' ;
16
16
while ( stack . length != 0 ) {
17
17
let temp = stack . pop ( ) ;
18
- if ( count == 1 ) {
18
+ if ( leftToRight ) {
19
19
if ( temp . leftNode ) queue . push ( temp . leftNode ) ;
20
20
if ( temp . rightNode ) queue . push ( temp . rightNode ) ;
21
- } else if ( count == 2 ) {
21
+ } else {
22
22
if ( temp . rightNode ) queue . push ( temp . rightNode ) ;
23
23
if ( temp . leftNode ) queue . push ( temp . leftNode ) ;
24
24
}
@@ -28,7 +28,7 @@ function levelOrderTraversalWithDirection(root) {
28
28
levelElements = '' ;
29
29
while ( queue . length != 0 ) {
30
30
let temp = queue . shift ( ) ;
31
- if ( count == 1 ) {
31
+ if ( leftToRight ) {
32
32
if ( temp . leftNode ) stack . push ( temp . leftNode ) ;
33
33
if ( temp . rightNode ) stack . push ( temp . rightNode ) ;
34
34
} else {
@@ -38,8 +38,8 @@ function levelOrderTraversalWithDirection(root) {
38
38
levelElements = levelElements + temp . data + ' ' ;
39
39
}
40
40
console . log ( levelElements ) ;
41
- if ( count == 2 ) count = 0 ;
42
- count ++ ;
41
+ if ( leftToRight ) leftToRight = false ;
42
+ else leftToRight = true ;
43
43
}
44
44
}
45
45
//level - 1
0 commit comments