|
1 | 1 | /* eslint no-use-before-define: 0 */ // --> OFF |
2 | 2 | // O(n) Time and O(n) Space Complexity |
3 | 3 |
|
4 | | -inOrderTraverse=function (tree, array) { |
| 4 | +functioninOrderTraverse (tree, array) { |
5 | 5 | if (tree !== null) { |
6 | 6 | inOrderTraverse(tree.left, array) |
7 | 7 | array.push(tree.value) |
8 | 8 | inOrderTraverse(tree.right, array) |
9 | 9 | } |
10 | 10 | return array |
11 | 11 | } |
12 | | -preOrderTraverse=function (tree, array) { |
| 12 | +functionpreOrderTraverse (tree, array) { |
13 | 13 | if (tree !== null) { |
14 | 14 | array.push(tree.value) |
15 | 15 | preOrderTraverse(tree.left, array) |
16 | 16 | preOrderTraverse(tree.right, array) |
17 | 17 | } |
18 | 18 | } |
19 | 19 |
|
20 | | -postOrderTraverse =function(tree, array) { |
| 20 | +functionpostOrderTraverse (tree, array) { |
21 | 21 | if (tree !== null) { |
22 | 22 | postOrderTraverse(tree.left, array) |
23 | 23 | postOrderTraverse(tree.right, array) |
24 | 24 | array.push(tree.value) |
25 | 25 | } |
26 | 26 | } |
27 | 27 |
|
28 | | -export {preOrderTraverse}; |
29 | | -export{inOrderTraverse}; |
30 | | -export{postOrderTraverse} |
31 | | - |
| 28 | +export { preOrderTraverse } |
| 29 | +export { inOrderTraverse } |
| 30 | +export { postOrderTraverse } |
0 commit comments