We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 17a6fab + f94d12f commit e136eccCopy full SHA for e136ecc
Data Structures/Tree/Binary Search Tree.js
@@ -81,7 +81,7 @@ var Tree = (function () {
81
82
// Start by searching the root
83
Tree.prototype.search = function (val) {
84
- var found = this.root.search(val);
+ let found = this.root.search(val);
85
if (found === null) {
86
console.log(val + " not found");
87
}
@@ -92,7 +92,7 @@ var Tree = (function () {
92
93
// Add a new value to the tree
94
Tree.prototype.addValue = function (val) {
95
- var n = new Node(val);
+ let n = new Node(val);
96
if (this.root == null) {
97
this.root = n;
98
} else {
0 commit comments