Skip to content

Update DS.js #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
RohitPaul0007 wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update DS.js #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions DS.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -118,7 +118,7 @@ function BinarySearchTree(value) {

BinarySearchTree.prototype.size = function () {
// Declaro una variable que acumula el tamaño
var ret = 1;
let ret = 1;
// Si existiera izquierda le sumo su tamaño
if (this.left) ret += this.left.size();
// Si existiera derecha le sumo su tamaño
Expand Down Expand Up @@ -201,7 +201,7 @@ BinarySearchTree.prototype.breadthFirstForEach = function(cb) {
// mientras el largo del mismo sea mayor a cero
// Voy quitando el primer elemento del array
// De esta manera cada arbol recorrido va agregando sus subarboles a la ejecucion del for
for (var pointers = [this]; pointers.length > 0; pointers.shift()) {
for (let pointers = [this]; pointers.length > 0; pointers.shift()) {
// Llamo al callback con el valor de cada puntero
cb(pointers[0].value);
// Y si tubiera derecha o izquierda lo agrego al array
Expand All @@ -215,4 +215,4 @@ module.exports = {
Node,
LinkedList,
BinarySearchTree
};
};