|
| 1 | +class TreeNode { |
| 2 | + constructor(val, left, right) { |
| 3 | + this.val = (val === undefined ? 0 : val); |
| 4 | + this.left = (left === undefined ? null : left); |
| 5 | + this.right = (right === undefined ? null : right); |
| 6 | + } |
| 7 | +} |
| 8 | +/** |
| 9 | + * @param {TreeNode} root |
| 10 | + * @return {number} |
| 11 | + */ |
| 12 | +const getMinimumDifference = (root) => { |
| 13 | + console.log(Infinity - 1) |
| 14 | + console.log(1 - Infinity) |
| 15 | + let queue = [root], min = Infinity; |
| 16 | + |
| 17 | + while (queue.length > 0) { |
| 18 | + console.log("queue 1"); |
| 19 | + console.log(queue); |
| 20 | + |
| 21 | + let curr = queue.shift(); |
| 22 | + console.log("Processing"); |
| 23 | + console.log(curr); |
| 24 | + let l = -Infinity, r = Infinity; |
| 25 | + if (null !== curr.left) { |
| 26 | + l = curr.left.val; |
| 27 | + queue.push(curr.left); |
| 28 | + } |
| 29 | + |
| 30 | + if (null !== curr.right) { |
| 31 | + r = curr.right.val; |
| 32 | + queue.push(curr.right); |
| 33 | + } |
| 34 | + console.log("queue 2"); |
| 35 | + console.log(queue); |
| 36 | + |
| 37 | + console.log(`min:${min}, q-l:${curr.val - l}, r-q:${r - curr.val}`) |
| 38 | + |
| 39 | + min = Math.min(min, curr.val - l, r - curr.val); |
| 40 | + } |
| 41 | + |
| 42 | + return min; |
| 43 | +}; |
| 44 | + |
| 45 | +// [4,2,6,1,3] |
| 46 | +let x = getMinimumDifference(new TreeNode(4, |
| 47 | + new TreeNode(2, new TreeNode(1), new TreeNode(3)), new TreeNode(6, new TreeNode(5)))) |
| 48 | +console.log("x") |
| 49 | +console.log(x) |
0 commit comments