forked from knaxus/problem-solving-javascript
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.js
43 lines (39 loc) · 1016 Bytes
/
index.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
// eslint-disable-next-line no-unused-vars
const BST = require('../index');
function findAncestors(root, value) {
/**
* search the given node and meanwhile
* keep pushing the visited nodes
*/
let arr = [];
if (root === null) return [];
if (value > root.value) {
// traverse right
const left = findAncestors(root.rightChild, value);
arr = [...left, ...arr];
}
if (value < root.value) {
// traverse left
const right = findAncestors(root.leftChild, value);
arr = [...right, ...arr];
}
if (root.value === value) return arr;
arr = [...arr, root.value];
return arr;
}
// create a BST
// const myBST = new BST(6);
// myBST.add(4);
// myBST.add(9);
// myBST.add(2);
// myBST.add(5);
// myBST.add(14);
// myBST.add(8);
// myBST.add(12);
// myBST.add(10);
// // find 3rd max
// // console.log(myBST.root);
// console.log(myBST.traversePreorder());
// // console.log(myBST.root.rightChild);
// console.log(findAncestors(myBST.root, 10));
module.exports = findAncestors;