|
| 1 | +'use strict'; |
| 2 | +class Node { |
| 3 | + constructor(data) { |
| 4 | + this.data = data; |
| 5 | + this.leftNode = this.rightNode = null; |
| 6 | + } |
| 7 | +} |
| 8 | +function levelOrderTraversalLineByLine(root) { |
| 9 | + if (root == null) return; |
| 10 | + let queue = []; |
| 11 | + queue.push(root); |
| 12 | + queue.push(null); |
| 13 | + let output = ''; |
| 14 | + while (queue.length != 0) { |
| 15 | + let temp = queue.shift(); |
| 16 | + if (temp == null) { |
| 17 | + console.log(output); |
| 18 | + output = ''; |
| 19 | + if (queue.length == 0) break; |
| 20 | + queue.push(null); |
| 21 | + } else { |
| 22 | + output = output + temp.data + ' '; |
| 23 | + if (temp.leftNode) queue.push(temp.leftNode) |
| 24 | + if (temp.rightNode) queue.push(temp.rightNode) |
| 25 | + } |
| 26 | + } |
| 27 | +} |
| 28 | + |
| 29 | +let tree = new Node(1); |
| 30 | +tree.leftNode = new Node(2); |
| 31 | +tree.rightNode = new Node(3); |
| 32 | +tree.leftNode.leftNode = new Node(4); |
| 33 | +tree.leftNode.rightNode = new Node(5); |
| 34 | +tree.rightNode.leftNode = new Node(6); |
| 35 | +tree.rightNode.rightNode = new Node(7); |
| 36 | +levelOrderTraversalLineByLine(tree); |
| 37 | + |
0 commit comments