gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

fix: missing ! in final test case. Fixes issue #34725 (#35033)

Browse Source
This commit is contained in:
Fordco
2019-04-22 02:01:17 -04:00
committed by The Coding Aviator
parent e736179720
commit 5fb179a6ef
1 changed files with 70 additions and 47 deletions
Download Patch File Download Diff File Expand all files Collapse all files

117
curriculum/challenges/english/08-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.english.md
View File

@ -37,7 +37,7 @@ tests:
- text: An empty tree returns a height of <code>-1</code>. - text: An empty tree returns a height of <code>-1</code>.
testString: assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMaxHeight !== 'function') { return false; }; return (test.findMaxHeight() == -1); })(), 'An empty tree returns a height of <code>-1</code>.'); testString: assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.findMaxHeight !== 'function') { return false; }; return (test.findMaxHeight() == -1); })(), 'An empty tree returns a height of <code>-1</code>.');
- text: The <code>isBalanced</code> method returns true if the tree is a balanced binary search tree. - text: The <code>isBalanced</code> method returns true if the tree is a balanced binary search tree.
testString: assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.isBalanced !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return test.isBalanced(); })(), 'The <code>isBalanced</code> method returns true if the tree is a balanced binary search tree.'); testString: assert((function() { var test = false; if (typeof BinarySearchTree !== 'undefined') { test = new BinarySearchTree() } else { return false; }; if (typeof test.isBalanced !== 'function') { return false; }; test.add(4); test.add(1); test.add(7); test.add(87); test.add(34); test.add(45); test.add(73); test.add(8); return !test.isBalanced(); })(), 'The <code>isBalanced</code> method returns true if the tree is a balanced binary search tree.');
``` ```
@ -110,55 +110,78 @@ BinarySearchTree.prototype = {
```js ```js
var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2)); var displayTree = (tree) => console.log(JSON.stringify(tree, null, 2));
function Node(value) { function Node(value) {
this.value = value; this.value = value;
this.left = null; this.left = null;
this.right = null; this.right = null;
} }
function BinarySearchTree() { function BinarySearchTree() {
this.root = null; this.root = null;
// change code below this line // change code below this line
this.findMinHeight = function(root = this.root) { // change code above this line
if (root === null) { this.findMinHeight = function(root = this.root) {
return -1; // empty tree.
} else if (root.left === null && root.right === null) { if(root === null) {
return 0; return -1;
} else if (root.left == null) { }
return (this.findMinHeight(root.right) + 1); // leaf node.
} else if (root.right == null) { if(root.left === null && root.right === null) {
return (this.findMinHeight(root.left) + 1); return 0;
} else { }
return Math.min(this.findMinHeight(root.left), this.findMinHeight(root.right)) + 1; if(root.left === null){
} return this.findMinHeight(root.right) + 1;
} }
this.findMaxHeight = function(root = this.root) { if(root.right === null){
if (root === null) { return this.findMinHeight(root.left) + 1;
return -1; }
} else if (root.left === null && root.right === null) { const lHeight = this.findMinHeight(root.left);
return 0; const rHeight = this.findMinHeight(root.right);
} else if (root.left == null) { return Math.min(lHeight, rHeight) + 1;
return (this.findMaxHeight(root.right) + 1); };
} else if (root.right == null) { this.findMaxHeight = function(root = this.root) {
return (this.findMaxHeight(root.left) + 1); // empty tree.
} else { if(root === null) {
return Math.max(this.findMaxHeight(root.left), this.findMaxHeight(root.right)) + 1; return -1;
} }
} // leaf node.
this.isBalanced = function(root = this.root) { if(root.left === null && root.right === null) {
if (root === null || root.left === null || root.right === null) { return 0;
return false; }
} if(root.left === null){
let l = this.findMaxHeight(root.left); return this.findMaxHeight(root.right) + 1;
let r = this.findMaxHeight(root.right); }
let difference = Math.abs(r - l); if(root.right === null){
if (difference <= 1 && this.isBalanced(root.left) && this.isBalanced(root.right)) { return this.findMaxHeight(root.left) + 1;
return false; }
} const lHeight = this.findMaxHeight(root.left);
return true; const rHeight = this.findMaxHeight(root.right);
} return Math.max(lHeight, rHeight) + 1;
// change code above this line };
this.isBalanced = function(root = this.root) {
if(root === null) {
return true;
}
if(root.left === null && root.right === null){
return true;
}
if(root.left === null) {
return this.findMaxHeight(root.right) <= 0;
}
if(root.right === null) {
return this.findMaxHeight(root.left) <= 0;
}
const lHeight = this.findMaxHeight(root.left);
const rHeight = this.findMaxHeight(root.right);
if(Math.abs(lHeight - rHeight) > 1){
return false;
}
return this.isBalanced(root.left) && this.isBalanced(root.right);
};
} }
``` ```
</section> </section>