This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| var x = "!"; | |
| var outer = () => { | |
| var a = "there"; | |
| var inner = () => console.log("Hey " + a + x); | |
| return inner(); | |
| } | |
| outer(); // --> "Hey there!" |
cgradwohl
/ bst.js
Created
December 29, 2016 08:38
— forked from trevmex/bst.js
A simple binary search tree in JavaScript
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| * File: bst.js | |
| * | |
| * A pure JavaScript implementation of a binary search tree. | |
| * | |
| */ | |
| /* | |
| * Class: BST | |
| * |
NewerOlder