/
inorderTraversal.js
59 lines (55 loc) · 1.15 KB
/
inorderTraversal.js
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
function recInorderTrav(root, result = []) {
if (!root) return;
recInorderTrav(root.left, result);
result.push(root.data);
recInorderTrav(root.right, result);
return result;
}
function iterInorderTrav(root, result = []) {
if (!root) return root;
const stack = [];
while (stack.length || root) {
if (root) {
stack.push(root);
root = root.left;
} else {
const parent = stack.pop();
result.push(parent.data);
root = parent.right;
}
}
return result;
}
const tree1 = {
data: 25,
left: null,
right: {
data: 125,
left: {
data: 50,
left: null,
right: {
data: 75,
left: null,
right: { data: 100, left: null, right: null, next: null, parent: null },
next: null,
parent: null,
},
next: null,
parent: null,
},
right: {
data: 200,
left: null,
right: { data: 350, left: null, right: null, next: null, parent: null },
next: null,
parent: null,
},
next: null,
parent: null,
},
next: null,
parent: null,
};
console.log(recInorderTrav(tree1));
console.log(iterInorderTrav(tree1));